Monochromatic Hamiltonian Berge-cycles in colored hypergraphs

DOI10.1016/J.DISC.2016.09.032zbMATH Open1362.05092arXiv1403.2894OpenAlexW2963303824MaRDI QIDQ2397546FDOQ2397546

G. R. Omidi, Leila Maherani

Publication date: 22 May 2017

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

Abstract: It has been conjectured that for any fixed r and sufficiently large n, there is a monochromatic Hamiltonian Berge-cycle in every (r - 1)-coloring of the edges of the complete r-uniform hypergraph on n vertices. In this paper, we show that the statement of this conjecture is true with r-2 colors (instead of r-1 colors) by showing that there is a monochromatic Hamiltonian t-tight Berge-cycle in every b r-2 / t-1 -edge coloring of Kr n for any fixed r > t >= 2 and sufficiently large n. Also, we give a proof for this conjecture when r = 4 (the first open case). These results improve the previously known results in [2, 3, 4].

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

Recommendations

• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
• Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs
• Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs
• Long monochromatic Berge cycles in colored 4-uniform hypergraphs
• Properly colored Hamilton cycles in Dirac-type hypergraphs
• Monochromatic path and cycle partitions in hypergraphs
• On Hamiltonian-colored graphs
• Hamiltonian Berge cycles in random hypergraphs
• On Hamiltonian colorings of graphs
• Multicolored Hamilton cycles of the complete 3-uniform hypergraph

zbMATH Keywords

colored uniform hypergraphsmonochromatic Hamiltonian Berge-cycle

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

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

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

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