On the Number of Maximal Vertices of a Random Acyclic Digraph

DOI10.1137/1120047zbMath0362.60030OpenAlexW2011857629MaRDI QIDQ4136266

No author found.

Publication date: 1975

Published in: Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1120047

Mathematics Subject Classification ID

Combinatorial probability (60C05) Directed graphs (digraphs), tournaments (05C20)

Related Items (11)

Enumeration of connected components of acyclic digraph ⋮ On the shape of a random acyclic digraph ⋮ Asymptotic enumeration of extensional acyclic digraphs ⋮ Counting acyclic digraphs by sources and sinks ⋮ Counting directed acyclic and elementary digraphs ⋮ A Comparison of Random Task Graph Generation Methods for Scheduling Problems ⋮ On the number of labeled acyclic digraphs ⋮ Exact enumeration of acyclic deterministic automata ⋮ Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks ⋮ Uniform random generation of large acyclic digraphs ⋮ Acyclic Digraphs

This page was built for publication: On the Number of Maximal Vertices of a Random Acyclic Digraph