Acyclic orientations of random graphs (Q1271856): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:44, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Acyclic orientations of random graphs |
scientific article |
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
