Pancyclicity in Graph Families with the Ore-Type Condition

Abstract: Let $n \in \mathbb{N}$ with $n \geq 3$, and let $\mathcal{G} = {G_i:i\in [n]}$ be a family of $n$-vertex graphs on a common vertex set $V$, where the graphs in the family do not need to be distinct. A graph $H$ with vertex set $V$ is \emph{rainbow} in $\mathcal{G}$ if there exists an injection $φ: E(H) \to [n]$ such that $e \in E(G_{φ(e)})$ for every edge $e \in E(H)$, where $|E(H)|\leq n$. In 2020, Joos and Kim proved that $\mathcal{G}$ 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 $σ(\mathcal{G}) \geq n$, then $\mathcal{G}$ contains a rainbow Hamiltonian cycle, where the Ore-type condition $σ(\mathcal{G})$ is defined as follows: $$σ(\mathcal{G}) = \min{d_p(u) + d_q(v) \mid uv \notin E(G_i) \text{ for some } i \in [n] \text{ and for all } p, q \in [n]}.$$ In this paper, under the Ore-type condition, we show that either each vertex of $V$ is contained in a rainbow cycle of length $\ell$ for every $\ell\in[4,n]$, or $G_1=\cdots=G_n=K_{\frac{n}{2},\frac{n}{2}}$. As a corollary, we deduce the rainbow pancyclicity of $\mathcal{G}$, which supports the famous meta-conjecture posed by Bondy. Furthermore, we prove rainbow vertex-pancyclicity of $\mathcal{G}$ under the Ore-type condition and provide an extremal graph family to show that the result is sharp.

• The paper establishes that under an Ore-type condition (σ(𝒢) ≥ n), every vertex is part of a rainbow cycle for all lengths from 4 to n, except in complete balanced bipartite graphs.
• It extends classical Hamiltonicity results by introducing rainbow cycles in graph families and confirming exact threshold bounds that generalize Dirac and Ore theorems.
• The proof leverages induction, detailed local neighborhood analysis, and extremal constructions to ensure rainbow pancyclicity under increasing degree sum conditions.

Pancyclicity in Graph Families Under the Ore-Type Condition

Background and Motivation

The analysis of Hamiltonicity and pancyclicity in finite graphs, particularly under classical degree conditions, forms a cornerstone of extremal graph theory. Foundational results include Dirac's Theorem, which asserts that an $n$-vertex graph with minimum degree at least $n/2$ is Hamiltonian, and Ore's Theorem, which strengthens this by ensuring Hamiltonicity under the condition that for all non-adjacent vertex pairs $u,v$, $d(u) + d(v) \geq n$. Bondy's "meta-conjecture" suggests that most nontrivial sufficient conditions for Hamiltonicity should also yield pancyclicity, with explicit exceptions such as complete balanced bipartite graphs.

Recent work has focused on "transversal" or "rainbow" structures in graph families—collections of graphs on the same vertex set—with rainbow subgraphs defined so that the $i$-th edge belongs to the $i$-th graph in the family. This direction generalizes properties like Hamiltonicity and pancyclicity beyond single graphs to systems of graphs and has seen a series of Dirac-type and Ore-type analogues developed, including [joos2020] and [li2024].

This paper addresses the existence of rainbow cycles of all lengths in families of graphs satisfying an Ore-type degree condition, extending both classic results and recent work on rainbow Hamiltonian cycles under similar constraints.

Main Results

The central contribution is the following:

• Let $\mathcal{G} = \{G_1,\dots,G_n\}$ be a family of (not necessarily distinct) graphs on a common $n$-vertex set. Define the Ore-type condition

$$\sigma(\mathcal{G}) = \min \{d_p(u) + d_q(v) : uv \notin E(G_i) \text{ for some } i \in [n], \forall\, p,q \in [n]\}.$$

If $\sigma(\mathcal{G}) \geq n$, then either every vertex of $n/2$0 is contained in a rainbow cycle of length $n/2$1 for every $n/2$2, or $n/2$3, the complete balanced bipartite graph.

From this, the authors deduce rainbow pancyclicity: under the same Ore-type condition, $n/2$4 always contains a rainbow cycle of each length $n/2$5, unless each $n/2$6 is $n/2$7, in direct support of Bondy's conjecture in the rainbow/transversal context.

They further prove:

• Under the stricter Ore-type condition $n/2$8, $n/2$9 is rainbow vertex-pancyclic: for all $u,v$0 (typically $u,v$1), every vertex is in a rainbow cycle of length $u,v$2.

An explicit extremal construction demonstrates that the result is sharp.

Proof Strategy and Structural Lemmas

The proof architecture uses intricate inductive and extremal reasoning, predicated on:

1. Induction on Length: Once rainbow cycles of lengths $u,v$3 (Hamiltonian) and $u,v$4 exist, they recursively establish pancyclicity for all smaller $u,v$5.
2. Local Structure Analysis: The authors deploy a battery of claims regarding the neighborhoods of vertices across the constituent graphs, leveraging the Ore-type sum to guarantee overlaps in neighborhood sets across different graphs in the family.
3. Characterization of Extremal Configurations: When the Ore-type sum is tight, the only possible exception derives from the structure of balanced complete bipartite graphs, which do not admit pancyclicity except in degenerate cases.
4. Rainbow Cycle Construction: For each cycle length, by carefully choosing edge-color (graph) assignments, the authors ensure the "rainbow" property can be maintained. The lemma for the existence of rainbow cycles of length $u,v$6 is particularly delicate and underpins the inductive step.
5. Sharpness and Extremality: The construction $u,v$7 with specific parameter choices shows the bounds on the Ore-type sum cannot be relaxed without losing the full vertex-pancyclicity property.

Numerical Results and Notable Claims

• The threshold $u,v$8 is precisely tight except for the $u,v$9 exception, in direct alignment with Bondy’s meta-conjecture.
• Strengthening to $d(u) + d(v) \geq n$0 ensures vertex-pancyclicity, with the extremal construction showing that lesser bounds permit counterexamples.

These results generalize previous work, which only covered the Dirac-type minimum degree condition or rainbow Hamiltonian cycles, to the broader and more delicate context of Ore-type degree sums and full rainbow pancyclicity.

Implications and Future Directions

These theorems yield several substantial implications:

• Theoretical: The results push forward the program of extremal combinatorics on rainbow structures, validating Bondy’s meta-conjecture in the setting of graph families and Ore-type degree constraints. Given the central role of pancyclicity, such advances both unify and generalize a number of threads in Hamiltonicity theory.
• Practical: Families of graphs with transversal substructures have applications in network design, coloring, and discrete optimization wherein edge assignments across multiple constraints must be coordinated.
• Methodological: The technical approach—careful parity and neighborhood partitioning, and advanced combinatorial induction—may be adapted for transversal analogues of other extremal results (for example, for hypergraphs, directed graphs, or sparse random settings).

Future research directions include tightening the Ore-type threshold for more specialized classes, exploring hypergraph analogues, and investigating algorithmic consequences for certifying rainbow pancyclicity.

Conclusion

This work rigorously extends the classical theory of (pan)cyclicity in graphs to rainbow structures under the Ore-type condition, confirming a broad class of rainbow analogues to Bondy and Ore’s classical results, and providing precise structural characterization of extremal exceptions. The techniques and results are highly relevant for ongoing research in transversal structures, extremal combinatorics, and interconnected discrete systems.

Reference: "Pancyclicity in Graph Families with the Ore-Type Condition" (2604.27535)