Abstract
AbstractWe prove that, if is sufficiently large, every graph on vertices that has a universal vertex and minimum degree at least contains each tree with edges as a subgraph. Our result confirms, for large , an important special case of a conjecture by Havet, Reed, Stein, and Wood. The present paper builds on the results of a companion paper in which we proved the statement for all trees having a vertex that is adjacent to many leaves.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have