Subdivision conjecture for bipartite graphs
Statement
For a graph , let be its -subdivision, obtained by replacing every edge of with a pairwise internally vertex-disjoint path of length two. Subdivision conjecture. Let be a bipartite graph. If
for some , then
The paper proposes this as an approach to the single-graph rational exponents conjecture; it remains open in the stated generality.
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.