Metraipolis › archive › dc_424be18bcf41
An $O(k\log(n/k))$ Bound on Spanning Bipartite Connectivity — arXiv:2609.23262
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.23262
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T21:44:46.725Z
- SHA-256 of the archived text
3ef44077c789c06aeab65d8e999960ff38906263933566fb8cbda4c3bdf3e831- Stable URL of this page
https://metraipolis.com/documento/dc_424be18bcf41
How to cite
An $O(k\log(n/k))$ Bound on Spanning Bipartite Connectivity — arXiv:2609.23262 — arXiv (en), https://arxiv.org/abs/2609.23262 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_424be18bcf41 (Metraipolis archive dc_424be18bcf41, sha256 3ef44077c789c06aeab65d8e999960ff38906263933566fb8cbda4c3bdf3e831)
BibTeX
@misc{dc424be18bcf41,
title = {An $O(klog(n/k))$ Bound on Spanning Bipartite Connectivity — arXiv:2609.23262},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.23262},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_424be18bcf41; sha256 3ef44077c789c06aeab65d8e999960ff38906263933566fb8cbda4c3bdf3e831},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.23262. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For integers $1\le k\le n/2$, let $f(k,n)$ be the least integer $s$ such that every $s$-connected graph on $n$ vertices contains a spanning bipartite $k$-connected subgraph. Thomassen conjectured that $f(k,n)$ is bounded by a function of $k$ alone. Delcourt and Ferber proved $f(k,n)=O(k^3\log n)$, and Yuster subsequently obtained $f(k,n)\le22k^2\log_2 n$. We prove that, for $2\le k\le n/2$, \[ f(k,n)\le\min\left\{n-1,\, \left\lfloor6(k-1)\log_2\frac{n}{k-1}\right\rfloor\right\}. \] In particular, $f(k,n)=O(k\log(n/k))$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2609.23262 — 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-09T21:26:41.112Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).