In 1989, Thomassen asked whether there is an integer-valued function $f(k)$ such that every $f(k)$-connected graph admits a spanning, bipartite $k$-connected subgraph. In this paper we take a first, humble approach, showing the conjecture is true up to a $\log n$ factor.
@article{10_37236_4762,
author = {Michelle Delcourt and Asaf Ferber},
title = {On a conjecture of {Thomassen}},
journal = {The electronic journal of combinatorics},
year = {2015},
volume = {22},
number = {3},
doi = {10.37236/4762},
zbl = {1327.05133},
url = {http://geodesic.mathdoc.fr/articles/10.37236/4762/}
}
TY - JOUR
AU - Michelle Delcourt
AU - Asaf Ferber
TI - On a conjecture of Thomassen
JO - The electronic journal of combinatorics
PY - 2015
VL - 22
IS - 3
UR - http://geodesic.mathdoc.fr/articles/10.37236/4762/
DO - 10.37236/4762
ID - 10_37236_4762
ER -
%0 Journal Article
%A Michelle Delcourt
%A Asaf Ferber
%T On a conjecture of Thomassen
%J The electronic journal of combinatorics
%D 2015
%V 22
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/4762/
%R 10.37236/4762
%F 10_37236_4762
Michelle Delcourt; Asaf Ferber. On a conjecture of Thomassen. The electronic journal of combinatorics, Tome 22 (2015) no. 3. doi: 10.37236/4762
