The asymptotic number of acyclic digraphs. I

DOI10.1007/BF02579404zbMath0601.05025OpenAlexW1980755696MaRDI QIDQ1080860

Robert W. Robinson, L. Bruce Richmond, Nicholas C. Wormald, Edward A. Bender

Publication date: 1986

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579404

zbMATH Keywords

asymptotic formuladigraph enumerationnumber of digraphs

Mathematics Subject Classification ID

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

Related Items (14)

Current trends in asymptotics: Some problems and some solutions ⋮ Generating connected acyclic digraphs uniformly at random ⋮ The asymptotic number of acyclic digraphs. II ⋮ On the shape of a random acyclic digraph ⋮ Asymptotic enumeration of extensional acyclic digraphs ⋮ The birth of the strong components ⋮ Counting extensional acyclic digraphs ⋮ Counting directed acyclic and elementary digraphs ⋮ Generating functions of some families of directed uniform hypergraphs ⋮ Unnamed Item ⋮ Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks ⋮ Uniform random generation of large acyclic digraphs ⋮ Is hyper-extensionality preservable under deletions of graph elements? ⋮ Asymptotic enumeration of compacted binary trees of bounded right height

Cites Work

• Unnamed Item
• Acyclic orientations of graphs
• Counting Coloured Graphs. III

This page was built for publication: The asymptotic number of acyclic digraphs. I