Graphs with the fewest matchings

DOI10.1007/s00493-014-3188-yzbMath1399.05109arXiv1310.1879MaRDI QIDQ524194

Lauren Keough, Andrew John Radcliffe

Publication date: 25 April 2017

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

matchings

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C30: Enumeration in graph theory

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

Related Items

On 4-Sachs optimal graphs, Reflect-push methods. Part I: Two dimensional techniques, Graph vulnerability parameters, compression, and quasi-threshold graphs, Extremal threshold graphs for matchings and independent sets, On bipartite graphs having minimum fourth adjacency coefficient, Graph vulnerability parameters, compression, and threshold graphs, Extremal graphs for the Tutte polynomial

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Threshold graphs and related topics
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs
• The Number of Independent Sets in a Regular Graph
• The Complexity of the Partial Order Dimension Problem
• Graphs with maximal number of adjacent pairs of edges
• Extremal graphs for homomorphisms
• Difference graphs