Metraipolis › archive › dc_25afccd76e18

A Low-Diameter Nash-Williams--Tutte Theorem — arXiv:2611.05043

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.05043
License (as archived)
CC0-1.0
Archived
2026-11-04T12:48:52.588Z
SHA-256 of the archived text
fe0c1862a855205ec7baacd24afdef4967253cd2a24eedeeedc57d9780152c87
Stable URL of this page
https://metraipolis.com/documento/dc_25afccd76e18

How to cite

A Low-Diameter Nash-Williams--Tutte Theorem — arXiv:2611.05043 — arXiv (en), https://arxiv.org/abs/2611.05043 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_25afccd76e18 (Metraipolis archive dc_25afccd76e18, sha256 fe0c1862a855205ec7baacd24afdef4967253cd2a24eedeeedc57d9780152c87)
BibTeX
@misc{dc25afccd76e18,
  title = {A Low-Diameter Nash-Williams--Tutte Theorem — arXiv:2611.05043},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.05043},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_25afccd76e18; sha256 fe0c1862a855205ec7baacd24afdef4967253cd2a24eedeeedc57d9780152c87},
  year = {2026}
}

Archived text

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

The Nash-Williams--Tutte theorem characterizes the existence of $k$ edge-disjoint spanning trees by a condition on every vertex partition. We prove that, for simple graphs, the same condition guarantees $k$ edge-disjoint spanning trees, each of diameter $O(n/\delta)$ and with $O((n/\delta)\log(\delta+1))$ internal vertices, where $n$ is the number of vertices and $\delta$ is the minimum degree. Both bounds hold simultaneously for every tree, with absolute implicit constants independent of $k$, and each is asymptotically optimal in general. Our proof is constructive and yields a randomized algorithm with expected running time $\tilde{O}(n^5)$. We derive applications to short edge-disjoint routes and weak linkages, small Steiner trees, and survivable networks with short paths. The joint bounds also yield low-diameter spanning Eulerian subgraphs and short tours for postman and general routing problems.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2611.05043 — 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-04T12:32:32.038Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).