Perfect matching covering, the Berge–Fulkerson conjecture, and the Fan–Raspaud conjecture

Abstract

Let mt∗ be the largest rational number such that every bridgeless cubic graph G associated with a positive weight ω has t perfect matchings {M1,…,Mt} with ω(∪i=1tMi)≥mt∗ω(G). It is conjectured in this paper that m3∗=45, m4∗=1415, and m5∗=1, which are called the weighted PM-covering conjectures. The counterparts of this new invariant mt∗ and conjectures for unweighted cubic graphs were introduced by Kaiser et al. (2006). It is observed in this paper that the Berge–Fulkerson conjecture implies the weighted PM-covering conjectures. Each of the weighted PM-covering conjectures is further proved to imply the Fan–Raspaud conjecture. Furthermore, a 3PM-coverage index τ (respectively, τ∗ for the weighted case) is introduced for measuring the maximum ratio of the number of (respectively, the total weight of) edges covered by three perfect matchings in bridgeless cubic graphs and assessing how far a snark is from being 3-edge-colorable. It is proved that the determination of τ∗ for bridgeless cubic graphs is an NP-complete problem.