Acyclic orientations of random graphs (Q1271856): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1006/aama.1998.0595 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/AAMA.1998.0595 / rank | |||
Normal rank | |||
Latest revision as of 17:12, 10 December 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
0 references
0 references
