Skip to content

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

An $O(k\log(n/k))$ Bound on Spanning Bipartite Connectivity

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 subsequent...

G. Gutin, Y. Hao, Y. Zhou · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.