Published April 8, 2022 | Version v1
Journal article

Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound

Description

A classical result of Erdős and Gallai determines the maximum size $m(n,\nu)$ of a graph $G$ of order $n$ and matching number $\nu n$. We show that $G$ has factorially many maximum matchings provided that its size is sufficiently close to $m(n,\nu)$.

Abstract

International audience

Additional details

Identifiers

URL
https://hal.inria.fr/hal-03701284
URN
urn:oai:HAL:hal-03701284v1