A superlinear bound on the number of perfect matchings in cubic bridgeless graphs

DOI10.1016/j.ejc.2011.09.027zbMath1239.05149arXiv1002.4739OpenAlexW1994517928WikidataQ57601371 ScholiaQ57601371MaRDI QIDQ412270

Daniel Král', Louis Esperet, František Kardoš

Publication date: 4 May 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1002.4739

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings ⋮ On the expected number of perfect matchings in cubic planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Perfect matchings in claw-free cubic graphs
• An improved linear bound on the number of perfect matchings in cubic graphs
• Brick decompositions and the matching rank of graphs
• Matching theory
• Matching structure and the matching lattice
• Perfect matchings in planar cubic graphs
• A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs
• Rank of maximum matchings in a graph
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: A superlinear bound on the number of perfect matchings in cubic bridgeless graphs