Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
Journal of the European Mathematical Society, Tome 19 (2017) no. 6, pp. 1811-1844
Cet article a éte moissonné depuis la source EMS Press
Friedland's Lower Matching Conjecture asserts that if G is a d-regular bipartite graph on ν(G)=2n vertices, and mk(G) denotes the number of matchings of size k, then
Classification :
05-XX
Keywords: Matchings, matching polynomial, Benjamini–Schramm convergence, infinite regular tree, infinite biregular tree, 2-lift
Keywords: Matchings, matching polynomial, Benjamini–Schramm convergence, infinite regular tree, infinite biregular tree, 2-lift
@article{JEMS_2017_19_6_a4,
author = {P\'eter Csikv\'ari},
title = {Lower matching conjecture, and a new proof of {Schrijver's} and {Gurvits's} theorems},
journal = {Journal of the European Mathematical Society},
pages = {1811--1844},
year = {2017},
volume = {19},
number = {6},
doi = {10.4171/jems/706},
url = {http://geodesic.mathdoc.fr/articles/10.4171/jems/706/}
}
TY - JOUR AU - Péter Csikvári TI - Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems JO - Journal of the European Mathematical Society PY - 2017 SP - 1811 EP - 1844 VL - 19 IS - 6 UR - http://geodesic.mathdoc.fr/articles/10.4171/jems/706/ DO - 10.4171/jems/706 ID - JEMS_2017_19_6_a4 ER -
Péter Csikvári. Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems. Journal of the European Mathematical Society, Tome 19 (2017) no. 6, pp. 1811-1844. doi: 10.4171/jems/706
Cité par Sources :