On the shape of a random acyclic digraph

DOI10.1017/S0305004100068195zbMath0702.05040MaRDI QIDQ3480068

Brendan D. McKay

Publication date: 1989

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

zbMATH Keywords

randomasymptotically normally distributedlengthslabelled acyclic digraphslongest directed paths

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

Generating connected acyclic digraphs uniformly at random ⋮ Asymptotic enumeration of extensional acyclic digraphs ⋮ Counting directed acyclic and elementary digraphs ⋮ Exact enumeration of acyclic deterministic automata ⋮ Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks ⋮ Asymptotic enumeration of compacted binary trees of bounded right height ⋮ Counting phylogenetic networks

Cites Work

• The asymptotic number of acyclic digraphs. I
• The asymptotic number of acyclic digraphs. II
• Central and local limit theorems applied to asymptotic enumeration
• Acyclic orientations of graphs
• On the Number of Maximal Vertices of a Random Acyclic Digraph

This page was built for publication: On the shape of a random acyclic digraph