Properly colored Hamilton cycles in Dirac-type hypergraphs

DOI10.37236/10651OpenAlexW3039517906MaRDI QIDQ2692184

Sylwia Antoniuk, Nina Kamčev, Andrzej Ruciński

Publication date: 21 March 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-uniform hypergraphsproperly colored tight Hamilton cycle

Mathematics Subject Classification ID

Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rainbow Hamilton cycles in uniform hypergraphs
• On the Hamiltonicity of triple systems with high minimum degree
• Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
• Loose Hamilton cycles in hypergraphs
• Compatible Hamilton cycles in Dirac graphs
• Rainbow \(H\)-factors
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Dirac-type results for loose Hamilton cycles in uniform hypergraphs
• Hamilton \(\ell \)-cycles in uniform hypergraphs
• Graphs with cycles having adjacent lines different colors
• Alternating Hamiltonian cycles
• A property of the colored complete graph
• Properly coloured Hamiltonian cycles in edge-coloured complete graphs
• Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree
• Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems
• Graphs with Hamiltonian cycles having adjacent lines different colours
• Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
• Rainbow factors in hypergraphs
• Extensions of results on rainbow Hamilton cycles in uniform hypergraphs
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
• Bounded colorings of multipartite graphs and hypergraphs
• Compatible Hamilton cycles in random graphs
• Properly coloured copies and rainbow copies of large graphs with small maximum degree
• Recent advances on Dirac-type problems for hypergraphs
• A hypergraph blow-up lemma
• Hamiltonian chains in hypergraphs
• A rainbow blow‐up lemma
• A Rainbow Dirac's Theorem
• Robustness of graph properties

This page was built for publication: Properly colored Hamilton cycles in Dirac-type hypergraphs