Group weighted matchings in bipartite graphs
Journal of Algebraic Combinatorics, Tome 4 (1995) no. 2, pp. 165-171.

Voir la notice de l'article dans Electronic Library of Mathematics

Summary: Let $G$ be a bipartite graph with bicoloration ${ A, B}, | A| = | B|$, and let $w : E( G) w( S)$ = Õ $_{ e \~I S} w( e) w(S) = \prod $_e $\in S} w(e)$ . A Perfect matching $M$ Ĩ $\in A$, then either $G$ has no $w$-matchings, or $G$ has at least $( d - 1)! w$-matchings.
Mots-clés : bipartite matching, abelian group 
@article{JAC_1995__4_2_a1,
     author = {Aharoni, R. and Meshulam, R. and Wajnryb, B.},
     title = {Group weighted matchings in bipartite graphs},
     journal = {Journal of Algebraic Combinatorics},
     pages = {165--171},
     publisher = {mathdoc},
     volume = {4},
     number = {2},
     year = {1995},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/item/JAC_1995__4_2_a1/}
}
TY  - JOUR
AU  - Aharoni, R.
AU  - Meshulam, R.
AU  - Wajnryb, B.
TI  - Group weighted matchings in bipartite graphs
JO  - Journal of Algebraic Combinatorics
PY  - 1995
SP  - 165
EP  - 171
VL  - 4
IS  - 2
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/JAC_1995__4_2_a1/
LA  - en
ID  - JAC_1995__4_2_a1
ER  - 
%0 Journal Article
%A Aharoni, R.
%A Meshulam, R.
%A Wajnryb, B.
%T Group weighted matchings in bipartite graphs
%J Journal of Algebraic Combinatorics
%D 1995
%P 165-171
%V 4
%N 2
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/JAC_1995__4_2_a1/
%G en
%F JAC_1995__4_2_a1
Aharoni, R.; Meshulam, R.; Wajnryb, B. Group weighted matchings in bipartite graphs. Journal of Algebraic Combinatorics, Tome 4 (1995) no. 2, pp. 165-171. https://geodesic-test.mathdoc.fr/item/JAC_1995__4_2_a1/