Prof. Dr. Felix Joos: The hypergraph removal process
Ludwig Maximilian University of Munich (LMU Munich), Room B 349 Theresienstr. 39, Munich, GermanyFix some graph or uniform hypergraph F and then consider the following simple process: start with a large complete (hyper)graph Kn on n vertices and iteratively remove (the edge set of) copies of F as long as possible; each selection is made uniformly among all present copies of F at that time. This process is […]


