Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs

DOI10.1002/jgt.20427zbMath1223.05164OpenAlexW4248569100MaRDI QIDQ3553234

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

Publication date: 22 April 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20427

zbMATH Keywords

hypergraphHamiltonianBerge-cycle

Mathematics Subject Classification ID

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

Related Items

Monochromatic Hamiltonian Berge-cycles in colored hypergraphs ⋮ Hamilton saturated hypergraphs of essentially minimum size ⋮ Monochromatic partitions in local edge colorings ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Stability of the path-path Ramsey number

Cites Work

• Unnamed Item
• Highly connected monochromatic subgraphs
• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs
• The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
• On a problem of K. Zarankiewicz