3-uniform hypergraphs of bounded degree have linear Ramsey numbers

DOI10.1016/j.jctb.2007.08.008zbMath1140.05045arXivmath/0608442OpenAlexW2128310798MaRDI QIDQ2483473

Deryk Osthus, Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn

Publication date: 28 April 2008

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphsRamsey numbersembedding problemsregularity Lemma

Mathematics Subject Classification ID

Hypergraphs (05C65) Generalized Ramsey theory (05C55)

Related Items

On two problems in graph Ramsey theory, Ramsey numbers of 3-uniform loose paths and loose cycles, Diagonal Ramsey Numbers of Loose Cycles in Uniform Hypergraphs, Constructive Packings of Triple Systems, Monochromatic loose-cycle partitions in hypergraphs, The Ramsey Number for 3-Uniform Tight Hypergraph Cycles, Monochromatic bounded degree subgraph partitions, Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs, Dependent random choice, Ramsey numbers of sparse hypergraphs, On the Ramsey number of sparse 3-graphs, Ramsey numbers of sparse hypergraphs, The Ramsey number of Fano plane versus tight path, On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• The Ramsey number of a graph with bounded maximum degree
• The Ramsey number for hypergraph cycles. I.
• On Ramsey numbers of uniform hypergraphs with given maximum degree
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• Note on the 3-graph counting Lemma
• On the Ramsey number of sparse 3-graphs
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Linear Ramsey Numbers for Bounded-Degree Hypergrahps
• Regularity properties for triple systems
• Extremal problems on set systems
• Integer and fractional packings in dense 3‐uniform hypergraphs
• Regular Partitions of Hypergraphs: Regularity Lemmas
• Regular Partitions of Hypergraphs: Counting Lemmas
• The counting lemma for regular k‐uniform hypergraphs
• Combinatorial Theorems on Classifications of Subsets of a Given Set