Asymptotic enumeration and a 0-1 law for $m$-clique free graphs (Q3708834)

From MaRDI portal
Revision as of 10:05, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Asymptotic enumeration and a 0-1 law for $m$-clique free graphs
scientific article

    Statements

    title
    Asymptotic enumeration and a 0-1 law for $m$-clique free graphs (English)
    0 references
    author
    Phokion G. Kolaitis
    0 references
    Hans Jürgen Prömel
    0 references
    Bruce L. Rothschild
    0 references
    publication date
    1985
    0 references
    zbMATH Keywords
    asymptotic enumeration
    0 references
    random graphs
    0 references
    chromatic number
    0 references
    asymptotic probability
    0 references

    Identifiers

    zbMATH DE Number
    3935080
    0 references
    Wikidata QID
    Q114848716
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3708834&oldid=17200900"
    Powered by MediaWiki