Graph Theory: 46. Relation Between Minimun Degree and Subtrees
It is not surprising that a tree of order k is a subgraph of a complete graph of order at least k. Here I'll explain the result that shows for every tree T of order k, any graph with minimum degree at least k-1 will contain a subgraph isomorphic to T. The proof is by induction on the order of the tree.
-- Bits of Graph Theory by Dr. Sarada Herke.
Related videos:
• Graph Theory 37. Which Graphs are Trees - Graph Theory 37. Which Graphs are Trees
• Graph Theory: 12. Spanning and Induced Sub... - Graph Theory: 12. Spanning and Induced Subgraphs
For quick videos about Math tips and useful facts, check out my other channel
"Spoonful of Maths" - / spoonfulofmaths