ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For d700>0d700>0, there is a positive constant C0C_0 such that, for every C≥C0C\ge C_0 and m∈Nm\in\mathbb N, the following holds. Let GG be a graph on N=CmN=Cm vertices, and let δ(G)\delta(G) denote its minimum degree.

Spanning subdivision conjecture. If

δ(G)≥(1+ε)N2,\delta(G)\ge (1+\varepsilon)\frac{N}{2},

then GG contains a spanning HH-subdivision for every graph HH with mm edges and no isolated vertices.

This is a dense-host extension of the paper's spanning-subdivision results. The supplied text states it in a conjecture environment but gives no resolution evidence.

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.