Metraipolis › archive › dc_10eee9b482c5

4-Arc-Pancyclicity of Regular Multipartite Tournaments — arXiv:2609.12372

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.12372
License (as archived)
CC0-1.0
Archived
2026-10-16T03:49:18.907Z
SHA-256 of the archived text
5db957fe9ba54ec0289ec6c30ac1118bc7b63157a5dbe0a2c6ba977770a3a38c
Stable URL of this page
https://metraipolis.com/documento/dc_10eee9b482c5

How to cite

4-Arc-Pancyclicity of Regular Multipartite Tournaments — arXiv:2609.12372 — arXiv (en), https://arxiv.org/abs/2609.12372 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_10eee9b482c5 (Metraipolis archive dc_10eee9b482c5, sha256 5db957fe9ba54ec0289ec6c30ac1118bc7b63157a5dbe0a2c6ba977770a3a38c)
BibTeX
@misc{dc10eee9b482c5,
  title = {4-Arc-Pancyclicity of Regular Multipartite Tournaments — arXiv:2609.12372},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.12372},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_10eee9b482c5; sha256 5db957fe9ba54ec0289ec6c30ac1118bc7b63157a5dbe0a2c6ba977770a3a38c},
  year = {2026}
}

Archived text

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

A multipartite tournament is an orientation of a complete multipartite graph. We prove that every $r$-regular $c$-partite tournament with common partite-set cardinality $\alpha$ is $4$-arc-pancyclic whenever $c\ge93$; that is, every arc belongs to a cycle of each length from $4$ to $c\alpha$. This confirms the conjecture of Zhou and Zhang for all sufficiently large $c$ and provides a multipartite analog of Alspach's arc-pancyclicity theorem. Moreover, we also give a construction to show that 4-arc-pancyclic is the best possible. Next, we prove that every arc belongs to at least $c\alpha-\alpha-1$ cycles of pairwise distinct lengths when $c\ge7$ and $\alpha\ge2$. For regular $3$-partite tournaments with common partite-set cardinality $\alpha\ge2$, we obtain the sharp lower bound $\alpha$, settling the remaining case of a conjecture of Xia, Cai, Guo, and Wang.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-14 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.12372 — 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-16T03:18:59.209Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).