Combinatorial theorems in sparse random sets (Q350550)

From MaRDI portal
Revision as of 02:26, 13 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
Combinatorial theorems in sparse random sets
scientific article

    Statements

    title
    Combinatorial theorems in sparse random sets (English)
    0 references
    author
    David Conlon
    0 references
    Timothy Gowers
    0 references
    publication date
    7 December 2016
    0 references
    zbMATH Keywords
    extremal combinatorics
    0 references
    random graphs
    0 references
    random sets
    0 references
    sparse analogues
    0 references
    cites work
    Q4830805
    0 references
    Q5724802
    0 references
    Q5445384
    0 references
    Q5491017
    0 references
    Q4284624
    0 references
    Hypergraph containers
    0 references
    Q5548826
    0 references
    Q4101924
    0 references
    Q4200109
    0 references
    Q5781249
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C80
    0 references
    05D40
    0 references
    05C42
    0 references
    05D10
    0 references
    zbMATH DE Number
    6662216
    0 references
    OpenAlex ID
    W2964207251
    0 references
    Wikidata QID
    Q97694159
    0 references
    arXiv ID
    1011.4310
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q350550&oldid=36294107"
    Powered by MediaWiki