Asymptotic enumeration of extensional acyclic digraphs

DOI10.1007/S00453-012-9725-4MaRDI QIDQ378229zbMATH OpenOpenAlexFDO

Authors Stephan 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

limit theoremsasymptotic enumerationessential acyclic digraphsextensional acyclic digraphsfull sets

Mathematics Subject Classification ID

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

Recommendations

• Asymptotic enumeration of extensional acyclic digraphs
• The asymptotic number of acyclic digraphs. I
• Ranking, unranking and random generation of extensional acyclic digraphs
• Counting extensional acyclic digraphs
• On the shape of a random acyclic digraph

Cites work

• scientific article; zbMATH DE number 3409391 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• A characterization of Markov equivalence classes for acyclic digraphs
• Analytic combinatorics
• 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
• Asymptotic enumeration of extensional acyclic digraphs
• Counting acyclic digraphs by sources and sinks
• Counting extensional acyclic digraphs
• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• On the Number of Maximal Vertices of a Random Acyclic Digraph
• On the shape of a random acyclic digraph
• The Number of Full Sets with n Elements
• The asymptotic number of acyclic digraphs. I
• The asymptotic number of acyclic digraphs. II

Cited in

(15)

• Asymptotic enumeration of cographs
• On the shape of a random acyclic digraph
• Random generation of essential directed acyclic graphs
• Counting acyclic and strong digraphs by descents
• Set graphs. IV. Further connections with claw-freeness
• Is hyper-extensionality preservable under deletions of graph elements?
• scientific article; zbMATH DE number 91021 (Why is no real title available?)
• Asymptotic enumeration of Cayley digraphs
• scientific article; zbMATH DE number 861357 (Why is no real title available?)
• Asymptotic enumeration of extensional acyclic digraphs
• Ranking, unranking and random generation of extensional acyclic digraphs
• Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs
• Counting extensional acyclic digraphs
• Counting Markov equivalence classes for DAG models on trees
• Asymptotic enumeration of compacted binary trees of bounded right height

Describes a project that uses

Uses Software

• OEIS

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

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