Dirac circumference theorem (source code)

= Dirac circumference theorem
{c}

For an integer $k\geq2$, a finite <simple graph> that is $k$-<connected graph> has a cycle of length at least $\min\{|G|,2k\}$.