Explicit Construction of Small Folkman Graphs

DOI10.1137/070686743MaRDI QIDQ3544251zbMATH OpenOpenAlexFDO

Authors Linyuan Lu

Publication date 5 December 2008

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/070686743

zbMATH Keywords

\(K_4\)-freecirculant graphFolkman graphmonochromatic trianglespectrum

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Recommendations

• On the Folkman Numberf(2, 3, 4)
• scientific article; zbMATH DE number 706775
• scientific article; zbMATH DE number 4208095
• Three hundred million points suffice
• On the 3-colouring vertex Folkman number F(2,2,4)

Cited in

(12)

• Three hundred million points suffice
• On the nonexistence of some generalized Folkman numbers
• \(p\)-arrangeable graphs are Folkman linear
• On some edge Folkman numbers, small and large
• Extremal results in sparse pseudorandom graphs
• On the independence number of (3, 3)-Ramsey graphs and the Folkman number F_e(3, 3; 4)
• scientific article; zbMATH DE number 4208095 (Why is no real title available?)
• A Folkman linear family
• Finding Folkman Numbers via MAX CUT Problem
• Some recent results on Ramsey-type numbers
• The minimum number of vertices of graphs containing two monochromatic triangles for any edge \(2\)-coloring
• On some open questions for Ramsey and Folkman numbers

This page was built for publication: Explicit Construction of Small Folkman Graphs

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