Grinberg-Introduction-Graph-Theory · Problem 5.2

Trees and arborescences

Mathematics — Graph Theory · trees-leaves

Problem

Let TT be a tree. Let ww be any vertex of TT. Prove that TT has at least deg⁡w\deg w many leaves.

Related theory

Browse the problem library