On a Conjecture of Thomassen
Author(s)Delcourt, Michelle; Ferber, Asaf
MetadataShow full item record
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.
DepartmentMassachusetts Institute of Technology. Department of Mathematics
Electronic Journal of Combinatorics
European Mathematical Information Service (EMIS)
Delcourt, Michelle, and Asaf Ferber. "On a Conjecture of Thomassen." The Electronic Journal of Combinatorics 22(3) (2015), #P3.2.
Final published version