Exponentially many perfect matchings in cubic graphs

Details Exponentially many perfect matchings in cubic graphs Exponentially many perfect matchings in cubic graphs

2010-12-13

arxiv.org/abs/1012.2878v2

Mathematics

Combinatorics

Scientific paper

We show that every cubic bridgeless graph G has at least 2^(|V(G)|/3656)
perfect matchings. This confirms an old conjecture of Lovasz and Plummer.
This version of the paper uses a different definition of a burl from the
journal version of the paper and a different proof of Lemma 18 is given. This
simplifies the exposition of our arguments throughout the whole paper.

Affiliated with

Also associated with

No associations

Rating

Exponentially many perfect matchings in cubic graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exponentially many perfect matchings in cubic graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exponentially many perfect matchings in cubic graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-178038