2016/01/05 by Marién Abreu, Tomas Kaiser, Abreu, Marién +5
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO
paper · pdf · doi:10.48550/arxiv.1601.00870
19 pages, 19 figures
arxiv created 2016/01/05 · arxiv updated 2016/01/06
We study snarks whose edges cannot be covered by fewer than five perfect matchings. Esperet and Mazzuoccolo found an infinite family of such snarks, generalising an example provided by Hagglund. We construct another infinite family, arising from a generalisation in a different direction. The proof that this family has the requested property is computer-assisted. In addition, we prove that the snarks from this family (we call them treelike snarks) have circular flow number five and admit a 5-cycle double cover.