On a Conjecture of Thomassen

Author(s)
Delcourt, Michelle; Ferber, Asaf
Thumbnail
DownloadDelcourt-2015-On a conjecture.pdf (251.0Kb)
PUBLISHER_POLICY
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
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.
Date issued
2015-07
URI
http://hdl.handle.net/1721.1/98409
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
Electronic Journal of Combinatorics
Publisher
European Mathematical Information Service (EMIS)
Citation
Delcourt, Michelle, and Asaf Ferber. "On a Conjecture of Thomassen." The Electronic Journal of Combinatorics 22(3) (2015), #P3.2.
Version: Final published version
ISSN
1077-8926
Collections