Higher dimensional Aztec diamonds and a \((2^d+2)\)-vertex model

DOI10.1023/A:1018652320257zbMath0937.05057MaRDI QIDQ1301862

Mihai Ciucu

Publication date: 12 September 1999

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

zbMATH Keywords

hypergraphsperfect matchingsAztec diamond graphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

An improved upper bound for the \(3\)-dimensional dimer problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Alternating-sign matrices and domino tilings. II
• A complementation theorem for perfect matchings of graphs having a cellular completion
• Perfect matchings of cellular graphs
• An improved upper bound for the \(3\)-dimensional dimer problem

This page was built for publication: Higher dimensional Aztec diamonds and a \((2^d+2)\)-vertex model