A classical result of Erdős and Gallai determines the maximum size $m(n,ν)$ of a graph $G$ of order $n$ and matching number $νn$. We show that $G$ has factorially many maximum matchings provided that its size is sufficiently close to $m(n,ν)$.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。