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 at least 2 5 t + 1 5 s + α leaves, where α ≥ 8 5 . Moreover, α ≥ 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...