Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs

DOI10.1002/jgt.20329zbMath1165.05021OpenAlexW4248870434MaRDI QIDQ3528158

Paul Dorbec, Gábor N. Sárközy, Sylvain Gravier

Publication date: 8 October 2008

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

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

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) Generalized Ramsey theory (05C55) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Hypergraph Extensions of the Erdős-Gallai Theorem ⋮ Monochromatic Hamiltonian Berge-cycles in colored hypergraphs ⋮ Long monochromatic Berge cycles in colored 4-uniform hypergraphs ⋮ Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths ⋮ Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs ⋮ Hypergraph extensions of the Erdős-Gallai theorem ⋮ Unnamed Item ⋮ Spectra of cycle and path families of oriented hypergraphs

Cites Work

• Unnamed Item
• The Ramsey number for hypergraph cycles. I.
• The Ramsey number for a triple of long even cycles
• All Ramsey numbers for cycles in graphs
• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Hamiltonian chains in hypergraphs

This page was built for publication: Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs