An improved linear bound on the number of perfect matchings in cubic graphs
Combinatorics
2015-09-28 v1
Abstract
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.
Cite
@article{arxiv.0901.3894,
title = {An improved linear bound on the number of perfect matchings in cubic graphs},
author = {Louis Esperet and Daniel Kral and Petr Skoda and Riste Skrekovski},
journal= {arXiv preprint arXiv:0901.3894},
year = {2015}
}