Past exam of the mathematics course of the University of Cambridge / 2021 / ii / Paper 2 / 17G / a / Solution

A tree is a connected acyclic graph; acyclic means containing no cycle. Every component of an acyclic graph is a tree. If the component orders are $n_i$, each has $n_i-1$ edges, so with $c\ge 1$ components,