The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle
From MaRDI portal
Publication:3068812
DOI10.1017/S0963548310000209zbMath1215.05111MaRDI QIDQ3068812
András Gyárfás, Gábor N. Sárközy
Publication date: 17 January 2011
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items (11)
Long monochromatic Berge cycles in colored 4-uniform hypergraphs ⋮ On Ramsey numbers of 3-uniform Berge cycles ⋮ Monochromatic matchings in the shadow graph of almost complete hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ The extremal \(p\)-spectral radius of Berge hypergraphs ⋮ A note on Ramsey numbers for Berge-\(G\) hypergraphs ⋮ On the cover Turán number of Berge hypergraphs ⋮ A note on saturation for Berge-\(G\) hypergraphs ⋮ Ramsey numbers of Berge-hypergraphs and related structures ⋮ Ramsey Problems for Berge Hypergraphs ⋮ Multicolor Ramsey numbers for Berge cycles
Cites Work
- The Ramsey number for hypergraph cycles. I.
- A variant of the hypergraph removal lemma
- An improved bound for the monochromatic cycle partition number
- The Ramsey number for a triple of long even cycles
- Covering \(t\)-element sets by partitions
- The uniformity lemma for hypergraphs
- Blow-up lemma
- Three-color Ramsey numbers for paths
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
- On maximal paths and circuits of graphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Tripartite Ramsey numbers for paths
- The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
- Regularity lemmas for hypergraphs and quasi-randomness
- Hamiltonian chains in hypergraphs
- An algorithmic version of the blow-up lemma
- Regularity Lemma for k-uniform hypergraphs
This page was built for publication: The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle
