An improved linear bound on the number of perfect matchings in cubic graphs
classification
🧮 math.CO
keywords
perfectboundcubicmatchingsbridgelessconstantdiffersdimension
pith:PGONQ5QW Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{PGONQ5QW}
Prints a linked pith:PGONQ5QW badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.