Aztec diamonds, checkerboard graphs, and spanning trees

Simple item page
dc.creatorKnuth, Donald E.
dc.date1995-01-23
dc.date.accessioned2026-07-07T09:15:15Z
dc.date.available2026-07-07T09:15:15Z
dc.descriptionThis note derives the characteristic polynomial of a graph that represents nonjump moves in a generalized game of checkers. The number of spanning trees is also determined.
dc.identifierhttps://arxiv.org/abs/math/9501234
dc.identifierhttp://arxiv.org/abs/math/9501234
dc.identifierJ. Algebraic Combin. 6 (1997), no. 3, 253--257
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/152958
dc.subjectCombinatorics
dc.titleAztec diamonds, checkerboard graphs, and spanning trees
dc.typetext

Files

Collections

arXiv