A Folkman Linear Family

DOI10.1137/130947647zbMath1323.05051arXiv1409.0947OpenAlexW1753153342MaRDI QIDQ3449860

Yusheng Li, Qizhong Lin

Publication date: 30 October 2015

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

Full work available at URL: https://arxiv.org/abs/1409.0947

zbMATH Keywords

Folkman numberFolkman linearmultipartite regularity lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (9)

Degree Ramsey numbers for even cycles ⋮ Graph partitioning: an updated survey ⋮ Random bipartite Ramsey numbers of long cycles ⋮ Degree bipartite Ramsey numbers ⋮ Sparse multipartite graphs as partition universal for graphs with bounded degree ⋮ Bipartite Ramsey numbers for graphs of small bandwidth ⋮ \(p\)-arrangeable graphs are Folkman linear ⋮ Bipartite Ramsey numbers of cycles for random graphs ⋮ A note on upper bounds for some generalized Folkman numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On graphs with small Ramsey numbers. II.
• The Ramsey number of a graph with bounded maximum degree
• Large triangle-free subgraphs in graphs without \(K_ 4\)
• Three hundred million points suffice
• Erratum: ``Three hundred million points suffice
• The uniformity lemma for hypergraphs
• The Ramsey property for graphs with forbidden complete subgraphs
• Lower bounds of tower type for Szemerédi's uniformity lemma
• A few remarks on Ramsey--Turán-type problems
• On Ramsey numbers and \(K_ r\)-coloring of graphs
• On a bound of Graham and Spencer for a graph-colouring constant
• On graphs with small Ramsey numbers*
• Dependent random choice
• Explicit Construction of Small Folkman Graphs
• On the Folkman Numberf(2, 3, 4)
• A new upper bound for the bipartite Ramsey problem
• Regularity lemmas for hypergraphs and quasi-randomness
• On sets of integers containing k elements in arithmetic progression
• Computation of the Folkman numberFe(3, 3; 5)
• The Algorithmic Aspects of the Regularity Lemma
• Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
• On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• On Certain Sets of Integers
• On Certain Sets of Integers (II)

This page was built for publication: A Folkman Linear Family