S. Brandt and S. Thomassé, Dense triangle-free graphs are four-colorable: A solution to the Erd? os- Simonovits problem

M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Journal of the ACM, vol.42, issue.6, pp.1115-1145, 1995.
DOI : 10.1145/227683.227684
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.9509

D. Karger, R. Motwani, and M. Sudan, Approximate graph coloring by semidefinite programming, Journal of the ACM, vol.45, issue.2, pp.246-265, 1998.
DOI : 10.1145/274787.274791
URL : http://arxiv.org/abs/cs/9812008

D. G. Larman, A triangle free graph which cannot be 3 imbedded in any euclidean unit sphere, Journal of Combinatorial Theory, Series A, vol.24, issue.2, pp.24-162, 1978.
DOI : 10.1016/0097-3165(78)90004-3

J. Ne?et?il and M. Rosenfeld, Embedding graphs in Euclidean spaces, an exploration guided by Paul Erd? os, Geombinatorics, vol.6, pp.143-155, 1997.

M. Rosenfeld, Triangle free graphs that are not 3-embeddable in Sd, Journal of Combinatorial Theory, Series B, vol.33, issue.2, pp.191-195, 1982.
DOI : 10.1016/0095-8956(82)90069-7