An improved linear bound on the number of perfect matchings in cubic graphs

Details An improved linear bound on the number of perfect matchings in cubic graphs An improved linear bound on the number of perfect matchings in cubic graphs

2009-01-25

arxiv.org/abs/0901.3894v1

Mathematics

Combinatorics

Scientific paper

We show that every cubic bridgeless graph with n vertices has at least
3n/4-10 perfect matchings. This is the first bound that differs by more than a
constant from the maximal dimension of the perfect matching polytope.

Affiliated with

Also associated with

No associations

Rating

An improved linear bound on the number of 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 An improved linear bound on the number of perfect matchings in cubic graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An improved linear bound on the number of perfect matchings in cubic graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-504196