The basic interpolation theorem states that if graph G contains spanning trees having m and n leaves, with m<n, then for each integer k such that m<k<n, G contains a spanning tree having k leaves. Various generalizations and related topics will be discussed.
