Enumerating Acyclic Digraphs by Descents
arXiv:1709.00601
Abstract
A descent of a labeled acyclic digraph is a directed edge with . In this paper, we find a recurrence for the number of labeled acyclic digraphs with a given number of descents.
arXiv:1709.00601
A descent of a labeled acyclic digraph is a directed edge with . In this paper, we find a recurrence for the number of labeled acyclic digraphs with a given number of descents.