On the Random Greedy $F$-Free Hypergraph Process (Q3178438)

From MaRDI portal
Revision as of 10:04, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the Random Greedy $F$-Free Hypergraph Process
scientific article

    Statements

    title
    On the Random Greedy $F$-Free Hypergraph Process (English)
    0 references
    author
    Daniela Kühn
    0 references
    Deryk Osthus
    0 references
    Amelia Taylor
    0 references
    publication date
    13 July 2016
    0 references
    zbMATH Keywords
    random graphs
    0 references
    extremal problems
    0 references
    hypergraphs
    0 references

    Identifiers

    DOI
    10.1137/15M1050343
    0 references
    Mathematics Subject Classification ID
    05C80
    0 references
    05C65
    0 references
    05C35
    0 references
    zbMATH DE Number
    6603310
    0 references
    OpenAlex ID
    W2472555608
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3178438&oldid=37003347"
    Powered by MediaWiki