Tag Archives: Induction

A Proof by Induction with a Difficulty

  The time has come to prove that the number of edges in every finite tree is one less than the number of vertices (a tree is a connected graph with no cycle). The proof is by induction, but first you need … Continue reading

Posted in Teaching, What is Mathematics | Tagged , | 17 Comments