Asymptotic enumeration of extensional acyclic digraphs

DOI10.1007/s00453-012-9725-4zbMath1275.05029OpenAlexW1972446164MaRDI QIDQ378229

Stephan G. Wagner

Publication date: 11 November 2013

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-012-9725-4

zbMATH Keywords

asymptotic enumerationlimit theoremsessential acyclic digraphsextensional acyclic digraphsfull sets

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Set graphs. IV. Further connections with claw-freeness ⋮ Counting Markov equivalence classes for DAG models on trees ⋮ Unnamed Item ⋮ Is hyper-extensionality preservable under deletions of graph elements? ⋮ Asymptotic enumeration of compacted binary trees of bounded right height

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs
• Asymptotic behaviour of the poles of a special generating function for acyclic digraphs
• The asymptotic number of acyclic digraphs. I
• The asymptotic number of acyclic digraphs. II
• Counting acyclic digraphs by sources and sinks
• A characterization of Markov equivalence classes for acyclic digraphs
• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• Counting extensional acyclic digraphs
• On the shape of a random acyclic digraph
• On the Number of Maximal Vertices of a Random Acyclic Digraph
• Asymptotic enumeration of extensional acyclic digraphs
• The Number of Full Sets with n Elements

This page was built for publication: Asymptotic enumeration of extensional acyclic digraphs