Explicit Construction of Small Folkman Graphs

DOI10.1137/070686743zbMath1151.05036OpenAlexW1984539579MaRDI QIDQ3544251

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

spectrumcirculant graphmonochromatic triangleFolkman graph\(K_4\)-free

Mathematics Subject Classification ID

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

Related Items (10)

A Folkman Linear Family ⋮ Some recent results on Ramsey-type numbers ⋮ Finding Folkman Numbers via MAX CUT Problem ⋮ On some edge Folkman numbers, small and large ⋮ Extremal results in sparse pseudorandom graphs ⋮ Unnamed Item ⋮ On the nonexistence of some generalized Folkman numbers ⋮ \(p\)-arrangeable graphs are Folkman linear ⋮ On Some Open Questions for Ramsey and Folkman Numbers ⋮ On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$

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