Enumerating Acyclic Digraphs by Descents
Combinatorics
2017-09-05 v1
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.
Keywords
Cite
@article{arxiv.1709.00601,
title = {Enumerating Acyclic Digraphs by Descents},
author = {Kassie Archer and Christina Graves},
journal= {arXiv preprint arXiv:1709.00601},
year = {2017}
}