Besomi–Pavez-Signé–Stein conjecture on minimum and maximum degree
Statement
Let , let , and let be a graph. Write and for its minimum and maximum degrees, respectively.
Besomi–Pavez-Signé–Stein conjecture. If
and
then contains every tree with edges.
The conjecture combines minimum- and maximum-degree hypotheses to force the containment of every -edge tree. The source reports partial progress, including a relaxation of the case, but does not state that the conjecture itself has been resolved.
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.