Grid graphs, Gorenstein polytopes, and domino stackings

DOI10.1007/s00373-005-0858-yzbMath1189.05142arXiv0711.4151OpenAlexW2126665878MaRDI QIDQ844215

Matthias Beck, Christian Haase, Steven V. Sam

Publication date: 18 January 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

domino tilingsgrid graphsperfect matching polytopes

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items

The Jones polynomials of three-bridge knots via Chebyshev knots and billiard table diagrams, Unconditional reflexive polytopes

Uses Software

• Normaliz
• polymake

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The perfect matching polytope and solid bricks
• Generating functions for powers of Fibonacci numbers
• \(h\)-vectors of Gorenstein polytopes
• Compressed polytopes and statistical disclosure limitation
• Brick decompositions and the matching rank of graphs
• Domino tilings of rectangles with fixed width
• On dimer coverings of rectangles of fixed width
• Gorenstein polytopes obtained from bipartite graphs
• Convex polytopes all of whose reverse lexicographic initial ideals are squarefree
• The statistics of dimers on a lattice
• Computing the Continuous Discretely
• Polytopes, Rings, and K-Theory
• Decompositions of Rational Convex Polytopes
• Ehrhart polynomials, simplicial polytopes, magic squares and a conjecture of Stanley
• Maximum matching and a polyhedron with 0,1-vertices
• Combinatorial reciprocity theorems
• A reciprocity theorem for domino tilings