Related Experiment Video
Updated: May 26, 2026

Tree Core Analysis with X-ray Computed Tomography
Published on: September 22, 2023
The number of maximum matchings in a tree
Clemens Heuberger1, Stephan Wagner
1Institut für Mathematik B, Technische Universität Graz, Austria.
Abstract:
We determine upper and lower bounds for the number of maximum matchings (i.e., matchings of maximum cardinality) [Formula: see text] of a tree T of given order. While the trees that attain the lower bound are easily characterised, the trees with the largest number of maximum matchings show a very subtle structure. We give a complete characterisation of these trees and derive that the number of maximum matchings in a tree of order n is at most [Formula: see text] (the precise constant being an algebraic number of degree 14). As a corollary, we improve on a recent result by Górska and Skupień on the number of maximal matchings (maximal with respect to set inclusion).
Related Concept Videos
Survival Tree
Building a Survival Tree
Constructing a survival tree begins...
The Binomial Theorem
Maximum Deflection
The maximum deflection occurs at a specific point, known as point O, where the tangent to the deflection curve is horizontal. To find point O, the slope of the tangent at any...
Maximum Power Transfer
By substituting the entire circuit with...
The Maximum Power Transfer Theorem
The load connected draws the current, and the circuit delivers the power to the load. The alternating current flowing through the load is determined using the rectangular form of voltages, currents, network impedance, and load impedance. The average power delivered to the load is obtained from the product of the square of current and load resistance.
Sign Test for Matched Pairs
To conduct the sign test, we first calculate the differences in value between...
