ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph FF, let sub⁡(F)\operatorname{sub}(F) be its 11-subdivision, obtained by replacing every edge of FF with a pairwise internally vertex-disjoint path of length two. Subdivision conjecture. Let FF be a bipartite graph. If

ex⁡(n,F)=O(n1+α)\operatorname{ex}(n,F) = O(n^{1+\alpha})

for some α>0\alpha > 0, then

ex⁡(n,sub⁡(F))=O(n1+α2).\operatorname{ex}(n,\operatorname{sub}(F)) = O\left(n^{1+\frac{\alpha}{2}}\right).

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 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.