Monochromatic Hamiltonian Berge-cycles in colored hypergraphs

DOI10.1016/j.disc.2016.09.032zbMath1362.05092arXiv1403.2894OpenAlexW2963303824MaRDI QIDQ2397546

Leila Maherani, Gholam Reza Omidi

Publication date: 22 May 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.2894

zbMATH Keywords

colored uniform hypergraphsmonochromatic Hamiltonian Berge-cycle

Mathematics Subject Classification ID

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

Related Items (5)

A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles ⋮ Partitioning infinite hypergraphs into few monochromatic Berge-paths ⋮ On Ramsey numbers of 3-uniform Berge cycles ⋮ Perfect matchings in shadow colorings ⋮ Ramsey Problems for Berge Hypergraphs

Cites Work

• Unnamed Item
• Ramsey numbers of 3-uniform loose paths and loose cycles
• Long monochromatic Berge cycles in colored 4-uniform hypergraphs
• Monochromatic matchings in the shadow graph of almost complete hypergraphs
• The Ramsey number for hypergraph cycles. I.
• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
• On Hamilton's ideals
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs
• Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs
• The Ramsey Number for 3-Uniform Tight Hypergraph Cycles

This page was built for publication: Monochromatic Hamiltonian Berge-cycles in colored hypergraphs