The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
From MaRDI portal
Publication:3557509
DOI10.1017/S096354830800967XzbMath1216.05093MaRDI QIDQ3557509
Vojtěch Rödl, Tomasz Łuczak, Andrzej Ruciński, Yue Jian Peng, Penny E. Haxell, Jozef Skokan
Publication date: 23 April 2010
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items
Long monochromatic Berge cycles in colored 4-uniform hypergraphs, Monochromatic matchings in the shadow graph of almost complete hypergraphs, The Ramsey number of generalized loose paths in hypergraphs, Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs, Hamilton saturated hypergraphs of essentially minimum size, The Erdős-Szekeres Problem, The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle, Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs
Cites Work
- The Ramsey number for hypergraph cycles. I.
- The Ramsey number for a triple of long even cycles
- On the Ramsey number of sparse 3-graphs
- All Ramsey numbers for cycles in graphs
- 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
- Short paths in quasi-random triple systems with sparse underlying graphs
- Ramsey numbers for cycles in graphs
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
- On Dependency Graphs and the Lattice Gas
- Extremal problems on set systems
