Spanning trees with many leaves: new lower bounds in terms of number of vertices of degree~3 and at least~4

preprint2012arXivOpen access

Abstract

We prove, that every connected graph with ss vertices of degree 3 and tt vertices of degree at least~4 has a spanning tree with at least 25t+15s+α{2\over 5}t +{1\over 5}s+α leaves, where α≥85α\ge {8\over 5}. Moreover, α≥2α\ge 2 for all graphs besides three exclusions. All exclusion are regular graphs of degree~4, they are explicitly described in the paper. We present infinite series of graphs, containing only vertices of degrees~3 and~4, for which the maximal number of leaves in a spanning tree is equal for 25t+15s+2{2\over 5}t +{1\over 5}s+2. Therefore we prove that our bound is tight.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.