Kasteleyn cokernels and perfect matchings on planar bipartite graphs

DOI10.1007/s10801-022-01186-3zbMath1512.05338arXiv1808.09927MaRDI QIDQ6100536

Libby Taylor

Publication date: 12 May 2023

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.09927

zbMATH Keywords

Jacobianperfect matchingKasteleyn cokernel

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Riemann-Roch theory for graph orientations
• The complexity of computing the permanent
• A characterization of the Tutte polynomial via combinatorial embeddings
• Kasteleyn cokernels
• Geometric bijections between spanning trees and break divisors

This page was built for publication: Kasteleyn cokernels and perfect matchings on planar bipartite graphs