On a Conjecture of Thomassen
Name
Delcourt-2015-On a conjecture.pdf
Size
251.1 KB
Format
Adobe PDF
Checksum (MD5)
9a12fa3b9106cfec5e106254425f8c0e
Author(s)
Delcourt, Michelle
Ferber, Asaf
Date Issued
July 2015
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
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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.37236/4762
