Most Laplacian eigenvalues of a tree are small

We show that the number of Laplacian eigenvalues less than the average degree 2−2n of a tree having n vertices is at least ⌈n2⌉.