Enumerating Acyclic Digraphs by Descents
Abstract
A descent of a labeled acyclic digraph is a directed edge x y with x>y. In this paper, we find a recurrence for the number of labeled acyclic digraphs with a given number of descents.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.