\begin{definition}[Definition:Girth]
Let $G$ be a graph.
The '''girth''' of $G$ is the smallest length of any cycle in $G$.
An acyclic graph is defined as having a girth of infinity.
Category:Definitions/Graph Theory
\end{definition}