Acyclic orientations of random graphs (Q1271856)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Acyclic orientations of random graphs |
scientific article; zbMATH DE number 1221593
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Acyclic orientations of random graphs |
scientific article; zbMATH DE number 1221593 |
Statements
Acyclic orientations of random graphs (English)
0 references
11 November 1998
0 references
A Bernoulli subgraph of an undirected graph is a random subgraph obtained by independently keeping edges with a common probability. The distribution of the number of acyclic orientations is studied for a Bernoulli subgraph of a complete graph of order \(n\) and for a Bernoulli subgraph of an \(n\)-cube.
0 references
number of acyclic orientations
0 references
Bernoulli subgraph
0 references
0 references
0 references
