On the Number of Group-Weighted Matchings

被引：0
|
作者：
Jeff Kahn
Roy Meshulam
机构：
[1] Rutgers University,Dept. of Mathematics
[2] Technion,undefined
来源：
Journal of Algebraic Combinatorics | 1998年 / 7卷
关键词：
bipartite matching; digraph; finite abelian group; group algebra; Olson's Theorem;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Let G be a bipartite graph with a bicoloration {A,B}, |A|=|B|. Let E(G) → A x B denote the edge set of G, and let m(G) denote the number of perfect matchings of G. Let K be a (multiplicative) finite abelsian group |K| = k, and let w:E(G) → K be a weight assignment on the edges of G. FOr S → E(G) let w(S) = ∏e∈Sw(e). A perfect matching M of G is a w-matching if w(M)=1. We shall be interested in m(G,w), the number of w-matchings of G.
引用
收藏
页码：285 / 290
页数：5
相关论文
共 50 条
  • [41] Number of 5-Matchings in Graphs
    Vesalian, R.
    Asgari, F.
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2013, 69 (01) : 33 - 46
  • [42] Strong and weighted matchings in inhomogenous random graphs
    Ganesan, Ghurumuruhan
    ELECTRONIC COMMUNICATIONS IN PROBABILITY, 2021, 26 : 1 - 12
  • [43] On the total weight of weighted matchings of segment graphs
    Stoll, Thomas
    Zeng, Jiang
    ELECTRONIC JOURNAL OF COMBINATORICS, 2009, 16 (01):
  • [44] Constrained weighted matchings and edge coverings in graphs
    Plesnik, Jan
    Discrete Applied Mathematics, 92 (02): : 229 - 241
  • [45] ON THE NUMBER OF PERFECT MATCHINGS IN A BIPARTITE GRAPH
    de Carvalho, Marcelo H.
    Lucchesi, Claudio L.
    Murty, U. S. R.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (02) : 940 - 958
  • [46] On the number of r-matchings in a tree
    Kang, Dong Yeap
    Kim, Jaehoon
    Kim, Younjin
    Law, Hiu-Fai
    ELECTRONIC JOURNAL OF COMBINATORICS, 2017, 24 (01):
  • [47] On the number of F-matchings in a tree
    Law, Hiu-Fai
    ELECTRONIC JOURNAL OF COMBINATORICS, 2012, 19 (01):
  • [48] On the Number of Perfect Matchings in Random Lifts
    Greenhill, Catherine
    Janson, Svante
    Rucinski, Andrzej
    COMBINATORICS PROBABILITY & COMPUTING, 2010, 19 (5-6): : 791 - 817
  • [49] On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets
    Merino, C
    Salazar, G
    Urrutia, J
    GRAPHS AND COMBINATORICS, 2005, 21 (03) : 333 - 341
  • [50] On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets
    Criel Merino
    Gelasio Salazar
    Jorge Urrutia
    Graphs and Combinatorics, 2005, 21 : 333 - 341
12345