Avoiding 5-circuits in a 2-factor of cubic graphs

Barbora Candráková, Robert Lukoťka

We show that every bridgeless cubic graph $G$ on $n$ vertices other than the Petersen graph has a 2-factor with at most $2(n-2)/15$ circuits of length $5$. An infinite family of gr…