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{arxiv.1410.4902,
title = {On a Conjecture of Thomassen},
author = {Michelle Delcourt and Asaf Ferber},
journal= {arXiv preprint arXiv:1410.4902},
year = {2015}
}