Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, May 12, 2011, 12:15 pm
Duration: This information is not available in the database
Location: CAB G51
Speaker: Luca Gugelmann
For every integer r >= 2 we call a k-uniform hypergraph H on n vertices r- Ramsey-forcing if every r-edge-coloring of the underlying complete graph K_n contains a monochromatic copy of a K_k such that its vertices form an edge in H. We determine the threshold for a random k-uniform hypergraph with n vertices to be r-Ramsey-forcing.
Automatic MiSe System Software Version 1.4803M | admin login