Metraipolis › archive › dc_03fceb9989ad
Removable trees and matchings in $k$-connected and $k$-edge-connected graphs — arXiv:2608.03643
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.03643
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T12:55:51.917Z
- SHA-256 of the archived text
540c187750643d5bd9b6f58e99a10079fd40a5424e25adfb3a4e40932e6035f3- Stable URL of this page
https://metraipolis.com/documento/dc_03fceb9989ad
How to cite
Removable trees and matchings in $k$-connected and $k$-edge-connected graphs — arXiv:2608.03643 — arXiv (en), https://arxiv.org/abs/2608.03643 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_03fceb9989ad (Metraipolis archive dc_03fceb9989ad, sha256 540c187750643d5bd9b6f58e99a10079fd40a5424e25adfb3a4e40932e6035f3)
BibTeX
@misc{dc03fceb9989ad,
title = {Removable trees and matchings in $k$-connected and $k$-edge-connected graphs — arXiv:2608.03643},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.03643},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_03fceb9989ad; sha256 540c187750643d5bd9b6f58e99a10079fd40a5424e25adfb3a4e40932e6035f3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.03643. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
T. Hasunuma (J. Graph Theory, 2023) conjectured that if $G$ is a $k$-connected (resp. $k$-edge-connected) graph with minimum degree $\delta(G) \ge k + m - 1$, and $T$ is a tree of order $m$, then $G$ contains a removable copy of $T$, that is, a subtree $T'$ isomorphic to $T$ such that $G - E(T')$ is $k$-connected (resp. $k$-edge-connected). We prove (a strengthening of) this conjecture. We also consider removable matchings in graphs with high minimum degree. We show, among others, that if $G$ is a $k$-edge-connected graph on at least $2m$ vertices with minimum degree $\delta(G) \ge k + m$, then there exists a matching $M$ of size $m$ in $G$ for which $G-M$ is $k$-edge-connected. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-05 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2608.03643 — 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-31T12:42:47.781Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).