Counting acyclic digraphs by sources and sinks

DOI10.1016/0012-365X(95)00119-HzbMATH Open0863.05042MaRDI QIDQ1126301FDOQ1126301

Authors: Ira M. Gessel 

Publication date: 8 December 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

enumerationlabeled acyclic digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30)

Cites Work

• Acyclic orientations of graphs
• The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
• Combinatorial problems of commutation and rearrangements
• Enumerative applications of a decomposition for graphs and digraphs
• The number of labeled k-trees
• Title not available (Why is that?)
• On the Number of Maximal Vertices of a Random Acyclic Digraph
• Title not available (Why is that?)
• \(q\)-enumeration of convex polyominoes
• A noncommutative version of the matrix inversion formula
• Computation of the expected number of leaves in a tree having a given automorphism, and related topics
• On the number of labeled acyclic digraphs

Cited In (11)

• Random Generation of Directed Acyclic Graphs
• Counting extensional acyclic digraphs
• Acyclic orientations and the chromatic polynomial
• Acyclic digraphs
• Symbolic method and directed graph enumeration
• Generating functions of some families of directed uniform hypergraphs
• Generating connected acyclic digraphs uniformly at random
• Counting acyclic and strong digraphs by descents
• Asymptotic enumeration of extensional acyclic digraphs
• The birth of the strong components
• Counting directed acyclic and elementary digraphs

This page was built for publication: Counting acyclic digraphs by sources and sinks

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