Long monochromatic Berge cycles in colored 4-uniform hypergraphs

DOI10.1007/s00373-010-0908-yzbMath1221.05141OpenAlexW2132759301MaRDI QIDQ604661

Gábor N. Sárközy, Endre Szemerédi, András Gyárfás

Publication date: 12 November 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0908-y

zbMATH Keywords

colored complete uniform hypergraphsmonochromatic Hamiltonian Berge-cycles

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items

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, Partitioning infinite hypergraphs into few monochromatic Berge-paths, On Ramsey numbers of 3-uniform Berge cycles, Monochromatic partitions in local edge colorings, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Ramsey Problems for Berge Hypergraphs

Cites Work

• Unnamed Item
• Monochromatic matchings in the shadow graph of almost complete hypergraphs
• The Ramsey number for hypergraph cycles. I.
• The Ramsey number for a triple of long even cycles
• All Ramsey numbers for cycles in graphs
• Three-color Ramsey numbers for paths
• Highly connected monochromatic subgraphs
• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
• The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs
• The Ramsey Number for 3-Uniform Tight Hypergraph Cycles