The maximum number of perfect matchings in graphs with a given degree sequence.
Alon, Noga ; Friedland, Shmuel
The Electronic Journal of Combinatorics [electronic only], Tome 15 (2008), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2008-01-01
EUDML-ID : urn:eudml:doc:117197 
@article{05540875,
     title = {The maximum number of perfect matchings in graphs with a given degree sequence.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {15},
     year = {2008},
     zbl = {1183.05064},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05540875}
}

Alon, Noga; Friedland, Shmuel. The maximum number of perfect matchings in graphs with a given degree sequence.. The Electronic Journal of Combinatorics [electronic only], Tome 15 (2008) . http://gdmltest.u-ga.fr/item/05540875/