Kasteleyn cokernels and perfect matchings on planar bipartite graphs

被引：0
|
作者：
Taylor, Libby [1 ]
机构：
[1] Stanford Univ, Stanford, CA 94305 USA
来源：
JOURNAL OF ALGEBRAIC COMBINATORICS | 2023年 / 57卷 / 03期
关键词：
Kasteleyn cokernel; Perfect matching; Jacobian;
D O I：
10.1007/s10801-022-01186-3
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The determinant method of Kasteleyn gives a method of computing the number of perfect matchings of a planar bipartite graph. In addition, results of Bernardi exhibit a bijection between spanning trees of a planar bipartite graph and elements of its Jacobian. In this paper, we explore an adaptation of Bernardi's results, providing a simply transitive group action of the Kasteleyn cokernel of a planar bipartite graph on its set of perfect matchings, when the planar bipartite graph in question is of the form G(+), as defined by Kenyon, Propp and Wilson.
引用
收藏
页码：727 / 737
页数：11
相关论文
共 50 条
  • [21] Resonance Graphs and a Binary Coding of Perfect Matchings of Outerplane Bipartite Graphs
    Brezovnik, Simon
    Tratnik, Niko
    Pletersek, Petra Zigert
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2023, 90 (02) : 453 - 468
  • [22] On the order of almost regular bipartite graphs without perfect matchings
    Volkmann, Lutz
    Zingsem, Axel
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2008, 42 : 165 - 170
  • [23] Perfect matchings in inhomogeneous random bipartite graphs in random environment
    Bochi, Jairo
    Iommi, Godofredo
    Ponce, Mario
    CUBO-A MATHEMATICAL JOURNAL, 2022, 24 (02): : 263 - 272
  • [24] On the Number of Perfect Matchings for Some Certain Types of Bipartite Graphs
    Oteles, Ahmet
    FILOMAT, 2017, 31 (15) : 4809 - 4818
  • [25] Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs
    Goel, Ashish
    Kapralov, Michael
    Khanna, Sanjeev
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 11 - +
  • [26] Combinatorics of perfect matchings in plane bipartite graphs and application to tilings
    Fournier, JC
    THEORETICAL COMPUTER SCIENCE, 2003, 303 (2-3) : 333 - 351
  • [27] Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting
    Perarnau, Guillem
    Serra, Oriol
    COMBINATORICS PROBABILITY & COMPUTING, 2013, 22 (05): : 783 - 799
  • [28] Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs
    Goel, Ashish
    Kapralov, Michael
    Khanna, Sanjeev
    ACM TRANSACTIONS ON ALGORITHMS, 2010, 6 (02)
  • [29] Z-transformation graphs of perfect matchings of plane bipartite graphs: a survey
    Zhang, Heping
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2006, 56 (03) : 457 - 476
  • [30] ON THE EXPECTED NUMBER OF PERFECT MATCHINGS IN CUBIC PLANAR GRAPHS
    Noy, Marc
    Requile, Clement
    Rue, Juanjo
    PUBLICACIONS MATEMATIQUES, 2022, 66 (01) : 325 - 353
12345