Geodesic
Spanning trees with many leaves: new lower bounds in terms of number of vertices of degree~3 and at least~4
Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part V, Tome 406 (2012), pp. 31-66

Voir la notice de l'article provenant de la source Math-Net.Ru

We prove that every connected graph with $s$ vertices of degree 3 and $t$ vertices of degree at least 4 has a spanning tree with $\frac25t+\frac15s+\alpha$ leaves, where $\alpha\ge\frac85$. Moreover, $\alpha\ge2$ for all graphs besides three exclusions. All exclusion are regular graphs of degree 4, they are explicitly described in the paper. We present an 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 $\frac25t+\frac15s+2$. Therefore we prove that our bound is tight. 
@article{ZNSL_2012_406_a2,
     author = {D. V. Karpov},
     title = {Spanning trees with many leaves: new lower bounds in terms of number of vertices of degree~3 and at least~4},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {31--66},
     publisher = {mathdoc},
     volume = {406},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2012_406_a2/}
}
TY  - JOUR
AU  - D. V. Karpov
TI  - Spanning trees with many leaves: new lower bounds in terms of number of vertices of degree~3 and at least~4
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2012
SP  - 31
EP  - 66
VL  - 406
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2012_406_a2/
LA  - ru
ID  - ZNSL_2012_406_a2
ER  - 
%0 Journal Article
%A D. V. Karpov
%T Spanning trees with many leaves: new lower bounds in terms of number of vertices of degree~3 and at least~4
%J Zapiski Nauchnykh Seminarov POMI
%D 2012
%P 31-66
%V 406
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZNSL_2012_406_a2/
%G ru
%F ZNSL_2012_406_a2
D. V. Karpov. Spanning trees with many leaves: new lower bounds in terms of number of vertices of degree~3 and at least~4. Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part V, Tome 406 (2012), pp. 31-66. http://geodesic.mathdoc.fr/item/ZNSL_2012_406_a2/