HIGHLIGHTS
- who: Stu00e9phane Bessy et al. from the France Ulm University have published the research: Factorially Many Maximum Matchings Close to the Erdu02ddos-Gallai Bound, in the Journal: (JOURNAL)
- what: The authors show that G has factorially many maximum matchings provided that its size is sufficiently close to m(n u03bd). The authors provide some intuition for x and y.
SUMMARY
The starting point here was the observation that the two extremal graphs in_(i) and_(ii) have (2νn + 1)! and_(n - νn)νn (νn)!2νn maximum matchings, respectively. Estimating . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.