Grid graphs, Gorenstein polytopes, and domino stackings (Q844215)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Grid graphs, Gorenstein polytopes, and domino stackings
scientific article

    Statements

    Grid graphs, Gorenstein polytopes, and domino stackings (English)
    0 references
    0 references
    0 references
    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 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references