Asymptotic enumeration of extensional acyclic digraphs

DOI10.1007/S00453-012-9725-4zbMATH Open1275.05029OpenAlexW1972446164MaRDI QIDQ378229FDOQ378229

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

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

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)

Cites Work

• A characterization of Markov equivalence classes for acyclic digraphs
• Analytic combinatorics
• Title not available (Why is that?)
• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• The asymptotic number of acyclic digraphs. I
• The asymptotic number of acyclic digraphs. II
• Counting acyclic digraphs by sources and sinks
• 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
• Title not available (Why is that?)
• 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

Cited In (14)

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

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)