Grid graphs, Gorenstein polytopes, and domino stackings (Q844215)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5659941
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Grid graphs, Gorenstein polytopes, and domino stackings |
scientific article; zbMATH DE number 5659941 |
Statements
Grid graphs, Gorenstein polytopes, and domino stackings (English)
0 references
18 January 2010
0 references
This paper examines the properties of the prefect matching polytopes of grid graphs. In particular, the case where the polytope is Gorenstein is characterized. Perfect matchings of grid graphs are equivalent to domino tilings of rectangular boards. Domino stackings of height \(t\) generlize domino tilings, which are the case \(t=1\). The paper presents several results and open problems concerning domino stackings.
0 references
domino tilings
0 references
grid graphs
0 references
perfect matching polytopes
0 references
0 references
0.8967203
0 references
0 references
0.8959756
0 references
0.8881333
0 references
0.88718295
0 references
0 references
