Metraipolis › archive › dc_b350bb1dc2b6

A Bondy-type theorem for rainbow pancyclicity in graph systems — arXiv:2609.27692

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.27692
License (as archived)
CC0-1.0
Archived
2026-10-08T12:00:45.281Z
SHA-256 of the archived text
17851075245f2f501caff5211ba34fea9a346fe58d66a8215455b0c391d72f84
Stable URL of this page
https://metraipolis.com/documento/dc_b350bb1dc2b6

How to cite

A Bondy-type theorem for rainbow pancyclicity in graph systems — arXiv:2609.27692 — arXiv (en), https://arxiv.org/abs/2609.27692 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b350bb1dc2b6 (Metraipolis archive dc_b350bb1dc2b6, sha256 17851075245f2f501caff5211ba34fea9a346fe58d66a8215455b0c391d72f84)
BibTeX
@misc{dcb350bb1dc2b6,
  title = {A Bondy-type theorem for rainbow pancyclicity in graph systems — arXiv:2609.27692},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.27692},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b350bb1dc2b6; sha256 17851075245f2f501caff5211ba34fea9a346fe58d66a8215455b0c391d72f84},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.27692. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We establish a Hamiltonian-to-pancyclic analogue of Bondy's theorem for graph systems under an aggregate degree condition. Let $\G=(G_1,\ldots,G_n)$ be a graph system on a common $n$-vertex set $V$, and write $\delta(v)=\min_{i\in[n]}d_{G_i}(v)$. If $\G$ contains a rainbow Hamilton cycle and \[ \sum_{v\in V}\delta(v)\ge \left\lceil\frac{n^2}{2}\right\rceil-1, \] then $\G$ is rainbow pancyclic, unless $n$ is even and every member is the same balanced complete bipartite graph. For even $n$ the threshold is exact at the integer level. Unlike the usual transversal Dirac- or Ore-type hypotheses, our condition is not layerwise: the member attaining $\delta(v)$ may depend on $v$, and some vertices may have $\delta(v)<n/2$. Relative to a fixed rainbow Hamilton cycle, we count shortcuts whose colors are released by the Hamilton arcs they replace. A missing cycle length forces complementary shortcut supports to cross-intersect. A counting gap settles even shortening, while equality or near equality in odd shortening yields a distance-two exchange whose orbits force the balanced bipartite obstruction. At the lower integer threshold an exact defect identity shows that only one or two units of slack are available. \noindent\textbf{Keywords:} graph system; rainbow cycle; pancyclicity; Hamilton cycle; extremal graph theory.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-24 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.27692 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T12:00:26.563Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).