Lesson 1

Consider the set of vertices \(\{0, 1, \dotsc, n-1\}\). How many different trees exist on these vertices? (We call two trees different if they differ as sets of edges.) For example, for \(n=2\) there is one such tree. For \(n=3\), there are three:

Problem. What about \(n=4\)?