Odd-subdivision degree-boundedness conjecture
Statement
An odd subdivision of a graph is a graph obtained from by replacing each edge by a path of odd length. For a positive integer , a graph is -free if it contains no subgraph isomorphic to the complete bipartite graph . Odd-subdivision degree-boundedness conjecture. For every bipartite graph and positive integer , the -free graphs with no induced odd subdivision of have bounded average degree. This would simultaneously strengthen the degree-boundedness theorem of Kuhn and Osthus and the paper's pivot-minor result; the conjecture is presented as open, and it would also imply the cited theorem of Scott and Seymour when restricted to bipartite .
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.