The number of maximum matchings in a tree

DOI10.1016/j.disc.2011.07.028zbMath1238.05146arXiv1011.6554OpenAlexW2147992535WikidataQ35579446 ScholiaQ35579446MaRDI QIDQ409365

Clemens Heuberger, Stephan G. Wagner

Publication date: 13 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

boundstreesmaximum matchingsstructural characterisation

Mathematics Subject Classification ID

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

Related Items

Null decomposition of trees ⋮ The number of maximum matchings in a tree ⋮ On radius 2 trees with the maximum number of matchings ⋮ Maximal independent sets and maximal matchings in series-parallel and related graph classes ⋮ Maximal independent sets and maximal matchings in series-parallel and related graph classes ⋮ Trees with minimum number of infima closed sets

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of maximum matchings in a tree
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• Binary trees with the largest number of subtrees
• Trees with maximum number of maximal matchings
• Matching theory
• Theory of monomer-dimer systems
• Two Notes on Notation
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• The Number of Maximal Independent Sets in a Tree
• A Note on Independent Sets in Trees

This page was built for publication: The number of maximum matchings in a tree