Paperlane

no. 15 · Monday 16 November 2026

Prescribed-Vertex Rainbow Cycle Spectra in Graph Systems under a Local Ore Condition

Ailian Chen and Jiahuang Lin

math.CO · v2

Abstract

Let $\GraphSys=(G_1,\ldots,G_n)$ be a system of graphs on a common $n$-vertex set, put $δ(v)=\min_i d_{G_i}(v)$ and $E_\cap=\bigcap_i E(G_i)$, and write $d^c$ for rainbow distance. Assume that each $G_i$ is $2$-connected and that $d^c(u,v)\le2$ and $δ(u)+δ(v)<n$ imply $uv\in E_\cap$. We prove that either every prescribed vertex belongs to a rainbow cycle of every length $4,\ldots,n$, or all members coincide with the balanced complete bipartite graph. The non-exceptional systems are also rainbow pancyclic. Under the stronger local cutoff $4n/3-1$, every vertex additionally lies on a rainbow triangle, yielding rainbow vertex-pancyclicity; the cutoff is sharp in the stated congruence class. The proofs use prescribed-color detours, root-preserving neighborhood separation, and a rigidity theorem for missing rooted lengths.

fields
Combinatorics
pdf ↗ page arXiv:2610.24427 ↗