Acyclic orientations of random graphs (Q1271856)

From MaRDI portal
Revision as of 17:12, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    Identifiers