Channels, billiards, and perfect matching 2-divisibility
From MaRDI portal
Publication:2034082
DOI10.37236/9151zbMath1475.05148OpenAlexW3174751940MaRDI QIDQ2034082
Grant T. Barkley, Ricky Ini Liu
Publication date: 21 June 2021
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37236/9151
Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Applications of graphical condensation for enumerating matchings and tilings
- Smith normal form in combinatorics
- Domino tiling congruence modulo 4
- 2-adic behavior of numbers of domino tilings
- Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes
- Perfect matchings and perfect powers
- Kasteleyn cokernels
- The kernel of the adjacency matrix of a rectangular mesh
- Trees and matchings
- Tiling parity results and the holey square solution
- The statistics of dimers on a lattice
- Dimers, webs, and positroids
- From dimers to webs
- Enumeration of perfect matchings in graphs with reflective symmetry
This page was built for publication: Channels, billiards, and perfect matching 2-divisibility