Prove a graph is a tree
Source: 1961 All-Soviet Union Olympiad
August 4, 2015
combinatoricsgraph theoryTrees
Problem Statement
Consider points, some of them connected by segments. These segments do not intersect each other. You can reach every point from any every other one in exactly one way by traveling along the segments. Prove that the total number of segments is .