Centre for Discrete and Applicable Mathematics

 CDAM Research Report, LSE-CDAM-2006-06

May 2006


Unions of Perfect Matchings in Cubic Graphs and Implications of the Berge-Fulkerson Conjecture

Viresh Patel

The Berge-Fulkerson Conjecture states that every cubic bridgeless graph has six perfect matchings such that every edge of the graph is in exactly two of the perfect matchings. If the Berge-Fulkerson Conjecture is true, then what can we say about the proportion of edges of a cubic bridgeless graph that can be covered by k of its perfect matchings? This is the question we address in this paper. We then give a possible method for proving, independently of the Berge-Fulkerson Conjecture, the bounds obtained.

A PDF file (130 kB) with the full contents of this report can be downloaded by clicking here.

Alternatively, if you would like to get a free hard copy of this report, please send the number of this report, LSE-CDAM-2006-06, together with your name and postal address to:
CDAM Research Reports Series
Centre for Discrete and Applicable Mathematics
London School of Economics
Houghton Street
London WC2A 2AE, U.K.
Phone: +44(0)-20-7955 7494.
Fax: +44(0)-20-7955 6877.
Email: info@maths.lse.ac.uk 


Introduction to the CDAM Research Report Series.
CDAM Homepage.


Copyright © London School of Economics & Political Science 2006