Havet–Reed–Stein–Wood conjecture on tree containment
Statement
Let , and let be a graph. Write and for its minimum and maximum degrees, respectively.
Havet–Reed–Stein–Wood conjecture. If
and
then every tree with edges is a subgraph of .
This conjecture proposes a sharper maximum-degree condition at the endpoint corresponding to of the preceding conjecture. The source presents it as open and records counterexamples showing that related weaker minimum-degree conditions can require substantially larger maximum degree.
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.