Long monochromatic Berge cycles in colored 4-uniform hypergraphs

DOI10.1007/S00373-010-0908-YMaRDI QIDQ604661zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
• Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs
• Monochromatic Hamiltonian Berge-cycles in colored hypergraphs
• Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs
• The 3-colour Ramsey number of a 3-uniform Berge cycle

Cites work

• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• All Ramsey numbers for cycles in graphs
• Highly connected monochromatic subgraphs
• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
• Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs
• Monochromatic matchings in the shadow graph of almost complete 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
• The Ramsey number for 3-uniform tight hypergraph cycles
• The Ramsey number for a triple of long even cycles
• The Ramsey number for hypergraph cycles. I.
• Three-color Ramsey numbers for paths

Cited in

(9)

• Monochromatic partitions in local edge colorings
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Monochromatic Hamiltonian Berge-cycles in colored hypergraphs
• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
• On Ramsey numbers of 3-uniform Berge cycles
• Partitioning infinite hypergraphs into few monochromatic Berge-paths
• Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs
• Ramsey problems for Berge hypergraphs
• A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles

This page was built for publication: Long monochromatic Berge cycles in colored 4-uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604661)