Finding Folkman Numbers via MAX CUT Problem

DOI10.1016/J.ENDM.2008.01.018MaRDI QIDQ3503536zbMATH OpenOpenAlexFDO

Authors Andrzej Dudek, Vojtěch Rödl

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)

Recommendations

• The maximum cut problem
• Maximum cut parameterized by crossing number
• scientific article; zbMATH DE number 1506038
• scientific article; zbMATH DE number 1496855
• Finding the maximum cut by the greedy algorithm
• New bounds for the maximum cut problem
• Publication:4938789
• scientific article; zbMATH DE number 177539
• A branch-and-cut approach to the crossing number problem
• Solving the max-cut problem using eigenvalues

Cites work

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

Cited in

(1)

• Some recent results on Ramsey-type numbers

This page was built for publication: Finding Folkman Numbers via MAX CUT Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503536)