Enumerating Acyclic Digraphs by Descents

arXiv1709.00601MaRDI QIDQ6290809FDOQ6290809

Authors: Kassie Archer, Christina Graves 

Publication date: 2 September 2017

Abstract: A descent of a labeled acyclic digraph is a directed edge $xoy$ with $x>y$. In this paper, we find a recurrence for the number of labeled acyclic digraphs with a given number of descents.

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Enumeration in graph theory (05C30)

This page was built for publication: Enumerating Acyclic Digraphs by Descents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6290809)