3-uniform hypergraphs of bounded degree have linear Ramsey numbers
From MaRDI portal
Publication:2483473
DOI10.1016/J.JCTB.2007.08.008zbMATH Open1140.05045arXivmath/0608442OpenAlexW2128310798MaRDI QIDQ2483473FDOQ2483473
Daniela Kühn, Deryk Osthus, Oliver Cooley, Nikolaos Fountoulakis
Publication date: 28 April 2008
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Abstract: Chv'atal, R"odl, Szemer'edi and Trotter proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. We prove that the same holds for 3-uniform hypergraphs. The main new tool which we prove and use is an embedding lemma for 3-uniform hypergraphs of bounded maximum degree into suitable 3-uniform `pseudo-random' hypergraphs.
Full work available at URL: https://arxiv.org/abs/math/0608442
Recommendations
Cites Work
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Title not available (Why is that?)
- The counting lemma for regular k‐uniform hypergraphs
- Title not available (Why is that?)
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Regularity properties for triple systems
- Extremal problems on set systems
- Regular Partitions of Hypergraphs: Counting Lemmas
- The Ramsey number of a graph with bounded maximum degree
- On the Ramsey number of sparse 3-graphs
- The Ramsey number for hypergraph cycles. I.
- Linear Ramsey Numbers for Bounded-Degree Hypergrahps
- On Ramsey numbers of uniform hypergraphs with given maximum degree
- Integer and fractional packings in dense 3‐uniform hypergraphs
- Note on the 3-graph counting Lemma
Cited In (17)
- Ramsey numbers of 3-uniform loose paths and loose cycles
- On the Ramsey number of sparse 3-graphs
- On the size of 3-uniform linear hypergraphs
- Dependent random choice
- The Ramsey number of Fano plane versus tight path
- Monochromatic loose-cycle partitions in hypergraphs
- On Ramsey numbers of uniform hypergraphs with given maximum degree
- Monochromatic bounded degree subgraph partitions
- The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
- Diagonal Ramsey Numbers of Loose Cycles in Uniform Hypergraphs
- On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs
- On two problems in graph Ramsey theory
- Ramsey numbers of sparse hypergraphs
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
- Constructive Packings of Triple Systems
- Ramsey numbers of sparse hypergraphs
- Big Ramsey degrees of 3-uniform hypergraphs are finite
This page was built for publication: 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483473)
