Pancyclicity in Graph Families with the Ore-Type Condition
Luyi Li, Yubo Wang, Guiying Yan

TL;DR
This paper proves that under certain Ore-type degree sum conditions, a family of graphs on the same vertex set contains rainbow cycles of all lengths, supporting the rainbow pancyclicity conjecture and establishing sharp results.
Contribution
It extends previous rainbow Hamiltonian cycle results to rainbow pancyclicity and vertex-pancyclicity under Ore-type conditions, with sharp extremal examples.
Findings
Either each vertex lies in rainbow cycles of all lengths from 4 to n, or all graphs are complete bipartite with equal parts.
The paper establishes rainbow pancyclicity of the graph family under the Ore-type condition.
Provides extremal graph examples showing the results are sharp.
Abstract
Let with , and let be a family of -vertex graphs on a common vertex set , where the graphs in the family do not need to be distinct. A graph with vertex set is \emph{rainbow} in if there exists an injection such that for every edge , where . In 2020, Joos and Kim proved that contains a rainbow Hamiltonian cycle under the Dirac-type condition. Recently, Liu, Chen, and Ma generalized this result by replacing the Dirac-type condition with a more general Ore-type condition involving degree sums of non-adjacent vertices: If , then contains a rainbow Hamiltonian cycle, where the Ore-type condition is defined as follows: $ \sigma(\mathcal{G}) =…
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.
