The Ramsey Number for 3-Uniform Tight Hypergraph Cycles

DOI10.1017/S096354830800967XzbMath1216.05093OpenAlexW2095784445MaRDI QIDQ3557509

Penny E. Haxell, Vojtěch Rödl, Tomasz Łuczak, Jozef Skokan, Andrzej Ruciński, Yue Jian Peng

Publication date: 23 April 2010

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096354830800967x

Mathematics Subject Classification ID

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

Related Items (18)

A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles ⋮ Monochromatic Hamiltonian Berge-cycles in colored hypergraphs ⋮ Long monochromatic Berge cycles in colored 4-uniform hypergraphs ⋮ Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths ⋮ Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles ⋮ Uniform Turán density of cycles ⋮ The Ramsey number of generalized loose paths in hypergraphs ⋮ Minimum degree conditions for tight Hamilton cycles ⋮ Hamilton saturated hypergraphs of essentially minimum size ⋮ Monochromatic matchings in the shadow graph of almost complete hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Covering and tiling hypergraphs with tight cycles ⋮ Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs ⋮ Tight cycles and regular slices in dense hypergraphs ⋮ Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs ⋮ The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle ⋮ The Erdős-Szekeres Problem ⋮ Towards Lehel's conjecture for 4-uniform tight cycles

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

This page was built for publication: The Ramsey Number for 3-Uniform Tight Hypergraph Cycles