A Gessel–Viennot-Type Method for Cycle Systems in a Directed Graph

  • Christopher R. H. Hanusa
DOI: https://doi.org/10.37236/1063

Abstract

We introduce a new determinantal method to count cycle systems in a directed graph that generalizes Gessel and Viennot's determinantal method on path systems. The method gives new insight into the enumeration of domino tilings of Aztec diamonds, Aztec pillows, and related regions.

Published
2006-04-04
How to Cite
Hanusa, C. R. H. (2006). A Gessel–Viennot-Type Method for Cycle Systems in a Directed Graph. The Electronic Journal of Combinatorics, 13(1), #R37. https://doi.org/10.37236/1063
Issue
Volume 13 (2006)
Article Number
R37