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

Abstract

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 graphs attains this bound. We also show that $G$ has a 2-factor with at most $n/5.8\overline{3}$ odd circuits. This improves the previously known bound of $n/5.41$ [Lukoťka, Máčajová, Mazák, Škoviera: Small snarks with large oddness, arXiv:1212.3641 [cs.DM] ].

22 pages, 3 (8) figures. Submitted

References in corpus (2)

• Exponentially many perfect matchings in cubic graphs
• Circular edge-colorings of cubic graphs with girth six