Under the Ore-type condition σ(G) ≥ n, a family of n graphs on n vertices contains rainbow cycles of every length ℓ from 4 to n through every vertex, or all graphs equal K_{n/2,n/2}.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Pancyclicity in Graph Families with the Ore-Type Condition
Under the Ore-type condition σ(G) ≥ n, a family of n graphs on n vertices contains rainbow cycles of every length ℓ from 4 to n through every vertex, or all graphs equal K_{n/2,n/2}.