Extremal Graphs With a Given Number of Perfect Matchings

DOI10.1002/jgt.21687zbMath1269.05063OpenAlexW1581028993MaRDI QIDQ5325953

Douglas B. West, Derrick Stolee, Stephen G. Hartke, Matthew P. Yancey

Publication date: 31 July 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21687

zbMATH Keywords

perfect matchingchamberHetyei's theoremLovász cathedral theoremmatching-extendable

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

On the size and structure of graphs with a constant number of 1-factors ⋮ On graphs with a unique perfect matching

Uses Software

• nauty

Cites Work

• Unnamed Item
• On the size and structure of graphs with a constant number of 1-factors
• The complexity of computing the permanent
• Entropy bounds for perfect matchings and Hamiltonian cycles
• An entropy proof of the Kahn-Lovász theorem
• Graphs with the maximum or minimum number of 1-factors
• The maximum number of perfect matchings in graphs with a given degree sequence
• Systems of distinct representatives. II
• Graph Factors and Matching Extensions
• Isomorph-Free Exhaustive Generation
• The Factorization of Linear Graphs
• Unsolved problems in number theory
• An entropy proof of Bregman's theorem

This page was built for publication: Extremal Graphs With a Given Number of Perfect Matchings