Enumeration of perfect matchings in graphs with reflective symmetry
From MaRDI portal
(Redirected from Publication:5961538)
A plane graph is called symmetric if it is invariant under the reflection across some straight line. We prove a result that expresses the number of perfect matchings of a large class of symmetric graphs in terms of the product of the number of matchings of two subgraphs. When the graph is also centrally symmetric, the two subgraphs are isomorphic and we obtain a counterpart of Jockusch's squarishness theorem. As application of our result, we enumerate the perfect matchings of several families of graphs and we obtain new solutions for the enumeration of two of the ten symmetry classes of plane partitions (namely, transposed complementary and cyclically symmetric, transposed complementary) contained in a given box. Finally, we consider symmetry classes of perfect matchings of the Aztec diamond graph and we solve the previously open problem of enumerating the matchings that are invariant under a rotation by 90 degrees.
Recommendations
Cited in
(92)- Enumerating spanning trees of graphs with an involution
- Domino tilings of Aztec diamonds and squares
- Enumeration of lozenge tilings of punctured hexagons
- The number of rhombus tilings of a ``punctured hexagon and the minor summation formula
- The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. I
- The number of centered lozenge tilings of a symmetric hexagon
- The equivalence between enumerating cyclically symmetric, self-complementary and totally symmetric, self-complementary plane partitions
- A complementation theorem for perfect matchings of graphs having a cellular completion
- Perfect matchings and perfect powers
- Forcing matchings on square grids
- Asymptotics of random domino tilings of rectangular Aztec diamonds
- Enumeration of lozenge tilings of a hexagon with a shamrock missing on the symmetry axis
- Symmetries of shamrocks. II: Axial shamrocks
- Interactions between interleaving holes in a sea of unit rhombi
- Symmetries of shamrocks. I.
- Interpretations of some parameter dependent generalizations of classical matrix ensembles
- Graphical condensation for enumerating perfect matchings
- Enumeration of Lozenge tilings of hexagons with cut-off corners
- Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
- Tiling generating functions of halved hexagons and quartered hexagons
- Channels, billiards, and perfect matching 2-divisibility
- Lozenge tilings of a hexagon with a horizontal intrusion
- Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes
- Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices
- An extension of the Lindström-Gessel-Viennot theorem
- Extreme diagonally and antidiagonally symmetric alternating sign matrices of odd order
- Bijective proofs of skew Schur polynomial factorizations
- Twenty-vertex model with domain wall boundaries and domino tilings
- Squareness for the monopole-dimer model
- Billiards, channels, and perfect matching 2-divisibility
- Lozenge tiling function ratios for hexagons with dents on two sides
- Fourier transform on high-dimensional unitary groups with applications to random tilings
- Enumeration of hybrid domino-lozenge tilings
- Proof of two conjectures of Ciucu and Krattenthaler on the enumeration of lozenge tilings of hexagons with cut off corners
- Replacing Pfaffians and applications
- Factorization theorems for classical group characters, with applications to alternating sign matrices and plane partitions
- Pseudo-centrosymmetric matrices, with applications to counting perfect matchings
- The interaction of collinear gaps of arbitrary charge in a two dimensional dimer system
- Double Aztec rectangles
- The number of spanning trees of plane graphs with reflective symmetry
- Enumeration of perfect matchings of a type of Cartesian products of graphs
- The weak Lefschetz property for monomial ideals of small type
- Two counterparts of the TFK formula for cylinder graphs
- Enumeration of antisymmetric monotone triangles and domino tilings of quartered Aztec rectangles
- Four factorization formulas for plane partitions
- Generating function of the tilings of an Aztec rectangle with holes
- A factorization theorem for lozenge tilings of a hexagon with triangular holes
- Boundary partitions in trees and dimers
- Perfect matchings and genus of some Cartesian products of graphs
- Resistance distances and Kirchhoff index of graphs with an involution
- Perfect matchings and applications
- ALEXANDER POLYNOMIAL FOR EVEN GRAPHS WITH REFLECTIVE SYMMETRY
- Half-turn symmetric FPLs with rare couplings and tilings of hexagons
- A simple proof for the number of tilings of quartered Aztec diamonds
- Lozenge tilings of a halved hexagon with an array of triangles removed from the boundary
- A new lower bound for the number of perfect matchings of line graph
- Symmetry-preserving matchings
- scientific article; zbMATH DE number 2099352 (Why is no real title available?)
- Enumeration of tilings of quartered Aztec rectangles
- Signed lozenge tilings
- Enumeration of hybrid domino-lozenge tilings. III: centrally symmetric tilings
- Three interactions of holes in two dimensional dimer systems
- Cyclically symmetric lozenge tilings of a hexagon with four holes
- Cyclically symmetric lozenge tilings of a hexagon with four holes
- On the dimer problem of the vertex-edge graph of a cubic graph
- Arctic curves of the 20V model on a triangle
- Lozenge tilings of hexagons with removed core and satellites
- Off-diagonally symmetric domino tilings of the Aztec diamond
- scientific article; zbMATH DE number 7732126 (Why is no real title available?)
- On λ-determinants and tiling problems
- Off-diagonally symmetric domino tilings of the Aztec diamond of odd order
- Lozenge tilings of hexagons with intrusions. I: Generalized intrusion
- Lozenge tilings of a halved hexagon with an array of triangles removed from the boundary. II
- Round Aztec windows, a dual of the Aztec diamond theorem and a curious symmetry of the correlation of diagonal slits
- Cruciform regions and a conjecture of Di Francesco
- Propp's benzels and Lai's nearly symmetric hexagons with holes
- Further results on enumeration of perfect matchings of Cartesian product graphs
- Fully complementary higher dimensional partitions
- Constant term formulas for refined enumerations of Gog and Magog trapezoids
- Generalizing the divisibility property of rectangle domino tilings
- Enumeration of pattern-avoiding (0,1)-matrices and their symmetry classes
- A short combinatorial proof of Di Francesco's conjecture on Aztec triangles
- A Littlewood-type identity for Robbins polynomials
- Boundary dents, the arctic circle and the arctic ellipse (with an appendix by Michael Larsen)
- Chip removal. Urban renewal revisited
- Graphical condensation of plane graphs: a combinatorial approach
- Domino tiling congruence modulo 4
- On the number of matchings of graphs formed by a graph operation
- A visual proof of a result of Knuth on spanning trees of Aztec diamonds in the case of odd order
- Enumeration of Lozenge tilings of halved hexagons with a boundary defect
- Symmetry classes of spanning trees of aztec diamonds and perfect matchings of odd squares with a unit hole
- Tiling problems, automata, and tiling graphs
This page was built for publication: Enumeration of perfect matchings in graphs with reflective symmetry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961538)
