Spanning subdivision conjecture for dense graphs
Statement
For , there is a positive constant such that, for every and , the following holds. Let be a graph on vertices, and let denote its minimum degree.
Spanning subdivision conjecture. If
then contains a spanning -subdivision for every graph with 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.