The maximum number of perfect matchings in graphs with a given degree sequence.
The Electronic Journal of Combinatorics [electronic only] (2008)
- Volume: 15, Issue: 1, page Research Paper N13, 2 p.-Research Paper N13, 2 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topAlon, Noga, and Friedland, Shmuel. "The maximum number of perfect matchings in graphs with a given degree sequence.." The Electronic Journal of Combinatorics [electronic only] 15.1 (2008): Research Paper N13, 2 p.-Research Paper N13, 2 p.. <http://eudml.org/doc/117197>.
@article{Alon2008,
author = {Alon, Noga, Friedland, Shmuel},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {perfect matchings; permanents; complete balanced bipartite graphs},
language = {eng},
number = {1},
pages = {Research Paper N13, 2 p.-Research Paper N13, 2 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {The maximum number of perfect matchings in graphs with a given degree sequence.},
url = {http://eudml.org/doc/117197},
volume = {15},
year = {2008},
}
TY - JOUR
AU - Alon, Noga
AU - Friedland, Shmuel
TI - The maximum number of perfect matchings in graphs with a given degree sequence.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2008
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 15
IS - 1
SP - Research Paper N13, 2 p.
EP - Research Paper N13, 2 p.
LA - eng
KW - perfect matchings; permanents; complete balanced bipartite graphs
UR - http://eudml.org/doc/117197
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.