On the random greedy F-free hypergraph process
Research output: Contribution to journal › Article › peer-review
Colleges, School and Institutes
Let F be a strictly k-balanced k-uniform hypergraph with e(F) ≥ |F|- k+ 1 and maximum co-degree at least two. The random greedy F-free process constructs a maximal F-free hypergraph as follows. Consider a random ordering of the hyper-edges of the complete k-uniform hypergraph Kk n on n vertices. Start with the empty hypergraph on n vertices. Successively consider the hyperedges e of Kk n in the given ordering and add e to the existing hypergraph provided that e does not create a copy of F. We show that asymptotically almost surely this process terminates at a hypergraph with Õ(nk-(|F|-k)/(e(F)-1)) hyperedges. This is best possible up to logarithmic factors.
|Number of pages||5|
|Journal||Electronic Notes in Discrete Mathematics|
|Early online date||12 Nov 2015|
|Publication status||Published - Nov 2015|