Abstract
Alon and Wormald showed that any graph with minimum degree d contains a spanning star forest in which every connected component is of size at least Ω((d/\log d)^{1/3}). They asked if any connected graph with minimum degree at least d has a spanning tree in which every internal vertex has degree at least cd/\log d, for some absolute constant c > 0. We give a simple example showing that this is not the case.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.