A hierarchy of randomness for graphs (Q2576864)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A hierarchy of randomness for graphs
scientific article

    Statements

    title
    A hierarchy of randomness for graphs (English)
    0 references
    author
    Vera T. Sós
    0 references
    Miklós Simmonovits
    0 references
    publication date
    29 December 2005
    0 references
    Mathematics Subject Classification ID
    05C35
    0 references
    05C55
    0 references
    05C80
    0 references
    zbMATH DE Number
    2242150
    0 references
    zbMATH Keywords
    Ramsey-Turán problem
    0 references
    OpenAlex ID
    W1966727738
    0 references
    cites work
    Q3698835
    0 references
    Q4004078
    0 references
    Q4083721
    0 references
    Q3852212
    0 references
    Q3950588
    0 references
    Q3344024
    0 references
    Q3682518
    0 references
    Turán-Ramsey problems
    0 references
    Random induced graphs
    0 references
    Threshold functions
    0 references
    Q4100121
    0 references
    Q5544083
    0 references
    Q4773670
    0 references
    Q3267900
    0 references
    Q3286850
    0 references
    Q5567712
    0 references
    Q4065548
    0 references
    Q4500481
    0 references
    Q4519896
    0 references
    Ramanujan graphs
    0 references
    Q4284624
    0 references
    Q5548826
    0 references
    Q3312262
    0 references
    Q5689007
    0 references
    Ramsey-Turán theory
    0 references
    Q4053702
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2576864&oldid=34470450"
    Powered by MediaWiki