Lecture 5: More Counting and Generating Functions
MIT OpenCourseWare · 71:45
Cayley’s theorem says there are \(n^{n-2}\) labeled trees on \(n\) vertices; this lecture proves it by counting labeled rooted trees with ordered edges in two ways (via a reversible forest-building process), then intr...