Metraipolis › archive › dc_3fac1dcac73e
An approximate cactus-decomposition for vertex-connectivity — arXiv:2611.01772
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01772
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:49:48.084Z
- SHA-256 of the archived text
fb5475cfa6509a890c01e2ded7fce8f55b1ccdd49c173ebb6406bda0115b16a8- Stable URL of this page
https://metraipolis.com/documento/dc_3fac1dcac73e
How to cite
An approximate cactus-decomposition for vertex-connectivity — arXiv:2611.01772 — arXiv (en), https://arxiv.org/abs/2611.01772 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3fac1dcac73e (Metraipolis archive dc_3fac1dcac73e, sha256 fb5475cfa6509a890c01e2ded7fce8f55b1ccdd49c173ebb6406bda0115b16a8)
BibTeX
@misc{dc3fac1dcac73e,
title = {An approximate cactus-decomposition for vertex-connectivity — arXiv:2611.01772},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01772},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3fac1dcac73e; sha256 fb5475cfa6509a890c01e2ded7fce8f55b1ccdd49c173ebb6406bda0115b16a8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01772. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The classical cactus theorem of Dinitz, Karzanov and Lomonosov from 1976 states that the minimum edge-cuts of a connected graph are displayed by a cactus. For vertex-separations, Tutte's theorem gives an exact cactus-decomposition for connectivity $2$, but exact cactus-decompositions fail for higher connectivity. Extending earlier approximate cactus-decomposition results for connectivities $3$ and $4$ by Carmesin and Kurkofka [FOCS 2023] and Kurkofka and Planken [SODA 2026] to all connectivities, we prove that for every $k\in\mathbb{N}$ there is a constant $d=d(k)$ such that every $k$-connected graph $G$ admits a cactus-decomposition displaying $k$-separations such that every $k$-separation of $G$ has edit-distance at most $d$ to a displayed separation. Our proof develops tools that may be useful beyond this result. The first is a three-dimensional version of the classical corner-diagram method, which we use to show that triples of crossing $k$-separations have a controlled two-dimensional behaviour. The second is a covering-space approach for studying local crossing patterns from a global perspective. Third, we advance the theory of flowers, which originated in matroid theory.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2611.01772 — 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-03T18:15:38.078Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).