##  [Girth](/girth-0) 

 Definition

The length (number of edges) of the shortest cycle in a graph; defined as infinity if the graph contains no cycles (i.e., is a forest).

 

 

 

 

 

 





## Principle

Principle

Girth measures the local cyclic tightness of a graph: small girth indicates short cycles and dense local cycle structure, while large girth indicates tree-like or sparse local structure.

 

 

 

 

 





## Demonstration

Demonstration

A cycle graph C_n has girth n. Any tree has girth infinity. The Petersen graph has girth 5. In extremal graph constructions one seeks graphs with large girth and large minimum degree.

 

 

 

 

## Misapplication

Misapplication

Confusing girth with circumference (length of the longest cycle), cycle rank (number of independent cycles), or averaging cycle lengths; failing to account for multiple edges or loops in multigraph definitions.

 

 

 

 

 





## Consequence

Consequence

Girth gives constraints used in extremal graph theory, influences spectral properties and expansion, and interacts with coloring bounds; high girth can force certain lower bounds on chromatic number in constructed families.

 

 

 

 

## Reversal

Reversal

The reverse notion emphasizes longest cycles (circumference) or global cycle structure rather than the minimal local cycle; acyclicity corresponds to infinite girth and trivial cycle constraints.

 

 

 

 

 





## Boundary

Boundary

Standard girth refers to simple undirected graphs; for directed graphs one uses directed cycles, for multigraphs one must specify whether multiple edges or loops count as cycles, and for hypergraphs the notion changes.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Tension exists between girth and cycle-space dimension (first Betti number): a graph can have small girth but small cycle rank, or large girth with many independent cycles elsewhere; girth is a local minimality, not a global count.

 

 

 

 

 





## Synthesis

Synthesis

Girth is the minimal cycle length and serves as a local measure of cyclicity: it distinguishes tree-like behavior (infinite girth) from graphs rich in short cycles and plays a central role in extremal and spectral graph considerations.