\(p\)-arrangeable graphs are Folkman linear

DOI10.1007/s10255-021-1000-5zbMath1464.05263OpenAlexW3120021676MaRDI QIDQ2025193

Qizhong Lin, Xun Chen

Publication date: 11 May 2021

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-021-1000-5

zbMATH Keywords

Folkman numberFolkman linearmulti-partite regularity lemma

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large triangle-free subgraphs in graphs without \(K_ 4\)
• Three hundred million points suffice
• Erratum: ``Three hundred million points suffice
• The Ramsey property for graphs with forbidden complete subgraphs
• Lower bounds of tower type for Szemerédi's uniformity lemma
• Graphs with linearly bounded Ramsey numbers
• On Ramsey numbers and \(K_ r\)-coloring of graphs
• On a bound of Graham and Spencer for a graph-colouring constant
• Embedding into Bipartite Graphs
• Dependent random choice
• On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$
• A Folkman Linear Family
• Explicit Construction of Small Folkman Graphs
• On the Folkman Numberf(2, 3, 4)
• Computation of the Folkman numberFe(3, 3; 5)
• The edge Folkman number $F_e(3, 3; 4)$ is greater than 19
• Use of MAX-CUT for Ramsey Arrowing of Triangles
• On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring

This page was built for publication: \(p\)-arrangeable graphs are Folkman linear