On the maximum fraction of edges covered by t perfect matchings in a cubic bridgeless graph

Abstract

A conjecture of Berge and Fulkerson (1971) states that every cubic bridgeless graph contains 6 perfect matchings covering each edge precisely twice, which easily implies that every cubic bridgeless graph has three perfect matchings with empty intersection (this weaker statement was conjectured by Fan and Raspaud in 1994). Let m t be the supremum of all reals α ≤ 1 such that for every cubic bridgeless graph G, there exist t perfect matchings of G covering a fraction of at least α of the edges of G. It is known that the Berge-Fulkerson conjecture is equivalent to the statement that m 5 = 1, and implies that m 4 = 14 15 and m 3 = 4 5 . In the first part of this paper, we show that m 4 = 14 15 implies m 3 = 4 5 , and m 3 = 4 5 implies the Fan-Raspaud conjecture, strengthening a recent result of Tang, Zhang, and Zhu. In the second part of the paper, we prove that for any 2 ≤ t ≤ 4 and for any real τ lying in some appropriate interval, deciding whether a fraction of more than (resp. at least) τ of the edges of a given cubic bridgeless graph can be covered by t perfect matching is an NP-complete problem. This resolves a conjecture of Tang, Zhang, and Zhu.

Measures of Edge-Uncolorability of Cubic Graphs

“…Here we follow the terminology introduced by Espert and Mazzuoccolo in [27] for a standard operation on cubic graphs: given two cubic graphs G and H and two edges xy in G and uv in H, the glueing, or 2-cut-connection, of (G, xy) and (H, uv) is the graph obtained from G and H by removing the edges xy and uv, and adding the new edges xu and yv. In the resulting graph, we call these two new edges the clone edges of xy (or uv).…”

“…Kaiser, Král and Norine [67] proved that m 2 (G) ≥ 3 5 and this result is the best possible, since the union of any two 1-factors of the Petersen graph P contains 9 of the 15 edges of the graph. It is also proved that m 3 (G) ≥ 27 35 , but it is conjectured that m 3 (G) ≥ 4 5 = m 3 (P ) for every bridgeless cubic graph G. Let G be a cubic graph and S 3 be a list of three 1-factors…”