A Gessel-Viennot-type method for cycle systems in a directed graph
Christopher R. H. Hanusa
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.
Create a lesson
Related papers
Maximal anti-Ramsey problems for posets
Binlong Li, Balázs Patkós, Changxin Wang
An Improved Bound for Smith's Longest Cycles Conjecture via a Forbidden Subdivision
Douglas M. Chen
Perfect state transfer on Cayley graphs over dihedral groups: A complete and practical characterization
Shixin Wang
An Improvement to the Upper Bound for Marton's Covering Conjecture
Zhao Song, Song Yue
Vertex-transitive strongly regular graphs in the switching class of doubly transitive two-graphs
Robert F. Bailey, Gábor P. Nagy, Valentino Smaldore
Inversion-descent enumerators of 321-avoiding permutations
Qiongqiong Pan