The large first- and second-neighbourhood conjecture for tree embeddings
Statement
Let , and let be a graph. For a vertex , let denote its neighbourhood and let denote its second neighbourhood. Large first- and second-neighbourhood conjecture. If
and there is a vertex such that
then contains every tree with edges.
This offers a local alternative to imposing a large maximum degree, by requiring both the first and second neighbourhoods of one vertex to be large. The source presents it as an open approach to avoiding known extremal obstructions; no resolution is supplied.
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.