论文信息 - Explicit Construction of Small Folkman Graphs

Explicit Construction of Small Folkman Graphs

A Folkman graph is a $K_4$-free graph $G$ such that if the edges of $G$ are 2-colored, then there exists a monochromatic triangle. Erdos offered a prize for proving the existence of a Folkman graph with at most 1 million vertices. In this paper, we construct several "small" Folkman graphs within this limit. In particular, there exists a Folkman graph on 9697 vertices.

Linyuan Lu | Linyuan Lu

[1] S. Radziszowski,et al. On the most wanted Folkman graph , 2007 .

[2] Robert W. Irving. On a bound of Graham and Spencer for a graph-coloring constant , 1973 .

[3] P. Erdös. Problems and Results on Finite and Infinite Graphs , 1975 .

[4] Vojtech Rödl,et al. Large triangle-free subgraphs in graphs withoutK4 , 1986, Graphs Comb..

[5] J. Folkman. Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring , 1970 .

[6] Joel H. Spencer,et al. Three hundred million points suffice , 1988, J. Comb. Theory, Ser. A.

[7] R. Graham. On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon , 1968 .

[8] K. Piwakowski,et al. Computation of the Folkman number F_e(3, 3; 5) , 1999 .

[9] Stanislaw P. Radziszowski,et al. Computation of the Folkman number Fe(3, 3; 5) , 1999, J. Graph Theory.

[10] V. Rödl,et al. The Ramsey property for graphs with forbidden complete subgraphs , 1976 .