arXiv Analytics

Sign in

arXiv:math/0512060 [math.CO]AbstractReferencesReviewsResources

A Gessel-Viennot-type method for cycle systems in a directed graph

Christopher R. H. Hanusa

Published 2005-12-02Version 1

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.

Comments: 22 pages, 33 figures
Journal: Electronic Journal of Combinatorics. Volume 13 (2006). Research Paper 37, 28 pp. (electronic)
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1305.2986 [math.CO] (Published 2013-05-14, updated 2014-10-03)
Judicious partitions of directed graphs
arXiv:math/0207020 [math.CO] (Published 2002-07-02)
Computing roots of directed graphs is graph isomorphism hard
arXiv:2302.04050 [math.CO] (Published 2023-02-08)
Optimal bisections of directed graphs

Links

Toolbox