On a Conjecture of Thomassen
classification
🧮 math.CO
keywords
conjectureconnectedthomassenadmitsapproachaskedbipartiteevery
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.