On the Ramsey number of sparse 3-graphs
From MaRDI portal
Publication:1015430
DOI10.1007/s00373-008-0784-xzbMath1169.05024OpenAlexW2092296749MaRDI QIDQ1015430
Brendan Nagle, Vojtěch Rödl, Mathias Schacht, Sayaka Olsen
Publication date: 8 May 2009
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-008-0784-x
Related Items (15)
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 ⋮ Monochromatic loose-cycle partitions in hypergraphs ⋮ Linear Ramsey Numbers for Bounded-Degree Hypergrahps ⋮ The Ramsey Number for 3-Uniform Tight Hypergraph Cycles ⋮ Monochromatic bounded degree subgraph partitions ⋮ 3-uniform hypergraphs of bounded degree have linear Ramsey numbers ⋮ Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs ⋮ Dependent random choice ⋮ Ramsey numbers of sparse hypergraphs ⋮ Ramsey numbers of sparse hypergraphs ⋮ The Ramsey number of Fano plane versus tight path ⋮ A hypergraph blow-up lemma ⋮ On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On graphs with small Ramsey numbers. II.
- The Ramsey number of a graph with bounded maximum degree
- The Ramsey number for hypergraph cycles. I.
- A variant of the hypergraph removal lemma
- On Ramsey numbers of uniform hypergraphs with given maximum degree
- Graphs with linearly bounded Ramsey numbers
- 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
- On graphs with small Ramsey numbers*
- Subdivided graphs have linear ramsey numbers
- Extremal problems on set systems
- On Ramsey Numbers of Sparse Graphs
- Regular Partitions of Hypergraphs: Regularity Lemmas
- The counting lemma for regular k‐uniform hypergraphs
- The asymptotic number of triple systems not containing a fixed one
This page was built for publication: On the Ramsey number of sparse 3-graphs
