On the Folkman Number f(2, 3, 4)

Let f(2, 3, 4) denote the smallest integer n such that there exists a K 4-free graph of order n for which any 2-coloring of its edges yields at least one monochromatic triangle. It is well known that such a number must exist. For a long time, the best known upper bound, provided by J. Spencer, was f(2, 3, 4) < 3.109. Recently, L. Lu announced that f(2, 3, 4) < 10,000. In this note, we will give a computer-assisted proof showing that f(2, 3, 4) < 1000. To prove this, we will generalize an idea of Goodman's, giving a necessary and sufficient condition for a graph G to yield a monochromatic triangle for every edge coloring.

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

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

[3]  A. Goodman.  On Sets of Acquaintances and Strangers at any Party , 1959 .

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

[5]  B. Sudakov,et al.  Pseudo-random Graphs , 2005, math/0503745.

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

[7]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

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

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

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

[11]  Linyuan Lu,et al.  Explicit Construction of Small Folkman Graphs , 2008, SIAM J. Discret. Math..

[12]  Franz Rendl,et al.  A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations , 2007, IPCO.

[13]  Ray Hill,et al.  On Group Partitions Associated with Lower Bounds for Symmetric Ramsey Numbers , 1982, Eur. J. Comb..

[14]  Andrzej Dudek,et al.  Problems in extremal combinatorics , 2008 .

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

[16]  P. Erdös.  Problems and results on chromatic numbers in finite and infinite graphs , 1985 .

[17]  Ronald L. Graham,et al.  Erdős on Graphs , 2020 .