Thomassen's conjecture on dense bipartite subgraphs of large girth
Statement
Let . A bipartite graph has average degree at least if its average degree is at least the value of a function .
Thomassen's conjecture. There is a function such that, for all , every bipartite graph of average degree at least has a subgraph of average degree at least and girth at least .
This is a conjecture about finding arbitrarily dense subgraphs of arbitrarily large prescribed girth in bipartite graphs. The paper notes that the case of girth is currently the best known.
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.