The induced Thomassen conjecture
Statement
For a graph , write for its minimum degree and for its girth. A graph is induced-subgraph-free of the two basic obstructions when it contains neither the relevant clique nor biclique as an induced subgraph. The induced Thomassen conjecture. There is a function such that for any integers and , every graph with has an induced subgraph for which either , , or
The claim seeks an induced-subgraph analogue of Thomassen's conjecture. The clique and biclique alternatives are necessary because and have no induced subgraph of minimum degree greater than and girth greater than .
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.