On the random greedy \(F\)-free hypergraph process (Q322193)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the random greedy \(F\)-free hypergraph process
scientific article

    Statements

    On the random greedy \(F\)-free hypergraph process (English)
    0 references
    0 references
    0 references
    0 references
    14 October 2016
    0 references
    0 references
    random greedy process
    0 references
    hypergraph
    0 references
    \(F\)-free process
    0 references
    0 references
    0 references