Thomassen's bipartite high-girth subgraph conjecture
Statement
For an integer , a graph has girth at least if its shortest cycle has length at least . A graph has sufficiently large minimum degree when its minimum degree exceeds a threshold depending on .
Thomassen's conjecture. For every integer , every graph of sufficiently large minimum degree contains a bipartite subgraph of girth at least and large minimum degree.
The paper uses a weaker known result with girth at least and cites Thomassen's statement as a conjecture. No resolution is supplied in the text, so its status is left open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.