How does one show that any graph with $n$ vertices and at least $n$ edges must have at least one cycle?
Existence of cycle in a graph
1
$\begingroup$
graph-theory