The chromatic number of random graphs (Q5905438)

From MaRDI portal
Revision as of 22:06, 11 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 25759
Language Label Description Also known as
English
The chromatic number of random graphs
scientific article; zbMATH DE number 25759

    Statements

    The chromatic number of random graphs (English)
    0 references
    0 references
    0 references
    27 June 1992
    0 references
    An asymptotic concentration interval is given for the chromatic number of a Bernoulli graph \(G(n,p)\) when \(np\) is sufficiently large and \(p\to 0\).
    0 references
    0 references
    random graphs
    0 references
    chromatic number
    0 references
    Bernoulli graph
    0 references