An approach to the girth problem in cubic graphs

Aya Bernstine, Nati Linial

We offer a new, gradual approach to the largest girth problem for cubic graphs. It is easily observed that the largest possible girth of all $n$-vertex cubic graphs is attained by…