Almost all graphs with 1.44n edges are 3-colorable (Q3201078)

From MaRDI portal
Revision as of 03:17, 29 April 2025 by RedirectionBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Almost all graphs with 1.44n edges are 3-colorable
scientific article

    Statements

    Almost all graphs with 1.44n edges are 3-colorable (English)
    0 references
    1991
    0 references
    uniform asymptotic approximation
    0 references
    3-colorable
    0 references

    Identifiers