Finding Folkman Numbers via MAX CUT Problem

DOI10.1016/j.endm.2008.01.018zbMath1341.05071OpenAlexW2075238113MaRDI QIDQ3503536

Vojtěch Rödl, Andrzej Dudek

Publication date: 5 June 2008

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2008.01.018

zbMATH Keywords

graph coloringFolkman numbersMAX CUT problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

Some recent results on Ramsey-type numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Large triangle-free subgraphs in graphs without \(K_ 4\)
• Three hundred million points suffice
• The Ramsey property for graphs with forbidden complete subgraphs
• On a bound of Graham and Spencer for a graph-colouring constant
• On Sets of Acquaintances and Strangers at any Party
• Explicit Construction of Small Folkman Graphs
• Computation of the Folkman numberFe(3, 3; 5)
• On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring