0

Trees in a graph

Let \(k \geq 1\) be an integer, and let \(T\) be a tree on \(k+1\) vertices. Show that if a graph \(G\) has minimum degree at least \(k\), then \(G\) has a subgraph isomorphic to \(T\).

Related Content