Metraipolis › archive › dc_387d7587e351

Sharp digirth bounds for C(k,k)-subdivisions in digraphs — arXiv:2611.00720

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.00720
License (as archived)
CC0-1.0
Archived
2026-11-03T11:36:35.661Z
SHA-256 of the archived text
302d9e0450f436d8459ef3d3b6d0fca2dfc120a41f9d292c5393ab361553f5dd
Stable URL of this page
https://metraipolis.com/documento/dc_387d7587e351

How to cite

Sharp digirth bounds for C(k,k)-subdivisions in digraphs — arXiv:2611.00720 — arXiv (en), https://arxiv.org/abs/2611.00720 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_387d7587e351 (Metraipolis archive dc_387d7587e351, sha256 302d9e0450f436d8459ef3d3b6d0fca2dfc120a41f9d292c5393ab361553f5dd)
BibTeX
@misc{dc387d7587e351,
  title = {Sharp digirth bounds for C(k,k)-subdivisions in digraphs — arXiv:2611.00720},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.00720},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_387d7587e351; sha256 302d9e0450f436d8459ef3d3b6d0fca2dfc120a41f9d292c5393ab361553f5dd},
  year = {2026}
}

Archived text

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

For an integer $k\ge2$, let $C(k,k)$ denote the oriented cycle formed by two internally vertex-disjoint directed paths of length $k$ with the same initial and terminal vertices. We extend a problem of Picasarri-Arrieta and Rambaud [European J. Combin. 122 (2024)] on subdivisions of $C(k,k)$ to digraphs with several vertices of out-degree one. Following the sharp result of Chen et al. [ arXiv:2610.38574v1 (2026)] for at most one such vertex, we determine the exact digirth threshold when at most $r\ge4$ such vertices are permitted. Specifically, for all integers $k\ge2$ and $r\ge4$, every digraph of minimum out-degree at least one, with at most $r$ vertices of out-degree one and digirth at least $r(k-1)+1$, contains a subdivision of $C(k,k)$.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.00720 — 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-11-03T11:05:22.241Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).