Extremal results in sparse pseudorandom graphs (Q2445889)

From MaRDI portal
Revision as of 09:29, 8 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Extremal results in sparse pseudorandom graphs
scientific article

    Statements

    title
    Extremal results in sparse pseudorandom graphs (English)
    0 references
    author
    David Conlon
    0 references
    Jacob Fox
    0 references
    Yufei Zhao
    0 references
    publication date
    15 April 2014
    0 references
    zbMATH Keywords
    Szemerédi's regularity lemma
    0 references
    sparse regularity lemma
    0 references
    counting lemma
    0 references
    graph removal lemma
    0 references
    extremal combinatorics
    0 references
    sparse graphs
    0 references
    cites work
    Quasi-random graphs
    0 references
    Q4056030
    0 references
    Q5724802
    0 references
    Q5578805
    0 references
    Q4071274
    0 references
    Q3416250
    0 references
    Quasirandom Groups
    0 references
    Q4407452
    0 references
    Q3078208
    0 references
    Q4878666
    0 references
    Q5477817
    0 references
    Q3060865
    0 references
    Q4175585
    0 references
    Hypergraph containers
    0 references
    Q5548826
    0 references
    Q3220623
    0 references
    Q4200109
    0 references
    Q3768936
    0 references
    Q3825110
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C35
    0 references
    05C80
    0 references
    05C42
    0 references
    zbMATH DE Number
    6284924
    0 references
    Wikidata QID
    Q105583626
    0 references
    OpenAlex ID
    W2159703794
    0 references
    arXiv ID
    1204.6645
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2445889&oldid=35384119"
    Powered by MediaWiki