The Berge perfect matching conjecture asserts that every bridgeless cubic graph 
has perfect matching
cover index at most 5, i.e.,
 |
The conjecture is equivalent to the Fulkerson conjecture (Mazzuoccolo 2011).
Berge Perfect Matching Conjecture
See also
Bridgeless Graph, Cubic Graph, Fulkerson Conjecture, Perfect Matching, Perfect Matching Cover IndexExplore with Wolfram|Alpha
References
Mazzuoccolo, G. "The Equivalence of Two Conjectures of Berge and Fulkerson." J. Graph Th. 68, 125-128, 2011.Cite this as:
Weisstein, Eric W. "Berge Perfect Matching Conjecture." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/BergePerfectMatchingConjecture.html