Timeline for Maximum number of perfect matchings in a graph
Current License: CC BY-SA 2.5
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
May 18, 2023 at 5:44 | comment | added | The Amplitwist |
The link to emis.ams.org in a comment above seems to be broken, but the article can be found at the new website of the EMIS, or at EuDML, or at arXiv:0803.2578 [math.CO] (Zbl 1183.05064).
|
|
May 18, 2023 at 5:37 | comment | added | The Amplitwist |
The link to sciencedirect.com is broken, but the article can be found at doi:10.1016/j.disc.2009.08.016 (Zbl 1214.05120).
|
|
Apr 17, 2010 at 21:42 | vote | accept | Grigory Yaroslavtsev | ||
Apr 17, 2010 at 21:42 | comment | added | Grigory Yaroslavtsev | Thank you, this paper really gives the answer. In fact, it seems that the main result was obtained by Alon and Friedland in this paper: emis.ams.org/journals/EJC/Volume_15/PDF/v15i1n13.pdf. There they show that graphs which are union of complete bipartite graphs have the maximum number of perfect matchings among all graphs with the same degree sequence. | |
Apr 17, 2010 at 6:43 | history | answered | Igor Pak | CC BY-SA 2.5 |