In this paper and a companion paper, we prove that, if m is sufficiently
large, every graph on m+1 vertices that has a universal vertex and minimum
degree at least β32mββ contains each tree T with m
edges as a subgraph. The present paper already contains an approximate
asymptotic version of the result.
Our result confirms, for large m, an important special case of a recent
conjecture by Havet, Reed, Stein, and Wood.Comment: 46 page