ProbXiv
Explorersign in
Problem archiveProblem record

Statement

An odd subdivision of a graph GG is a graph obtained from GG by replacing each edge by a path of odd length. For a positive integer ss, a graph is Ks,sK_{s,s}-free if it contains no subgraph isomorphic to the complete bipartite graph Ks,sK_{s,s}. Odd-subdivision degree-boundedness conjecture. For every bipartite graph HH and positive integer ss, the Ks,sK_{s,s}-free graphs with no induced odd subdivision of HH 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 HH.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.