Compatible Powers of Hamilton Cycles in Dense Graphs
Xiaohan Cheng, Jie Hu, Donglei Yang

TL;DR
This paper extends the study of Hamiltonicity robustness in dense graphs with incompatibility constraints, proving the existence of compatible high powers of Hamilton cycles under certain degree conditions.
Contribution
It generalizes previous results by establishing conditions for the existence of compatible k-th powers of Hamilton cycles in graphs with incompatibility systems.
Findings
Existence of compatible k-th power Hamilton cycles under degree conditions
Construction of graphs with high minimum degree lacking such cycles
Extension of robustness results to higher powers of Hamilton cycles
Abstract
Motivated by the concept of transition system investigated by Kotzig in 1968, Krivelevich, Lee and Sudakov proposed a more general notion of incompatibility system to formulate the robustness of Hamiltonicity of Dirac graphs. Given a graph , an {\em incompatibility system} over is a family such that for every , is a family of edge pairs in . An incompatibility system is \emph{-bounded} if for every vertex and every edge incident with , there are at most pairs in containing . A subgraph of is \emph{compatible} (with respect to ) if every pair of adjacent edges of satisfies , where . Krivelevich, Lee and Sudakov proved that there is an universal constant…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Limits and Structures in Graph Theory · Finite Group Theory Research
