On 21.11.2013 at 12:20 in S6, there is the following noon lecture:
Uniform hypergraphs containing no grids
We will investigate linear uniform hypergraphs containing no grids. The problem is related to the Ruzsa-Szemerédi Theorem. Our construction is slightly better then the one of Frankl and Rödl.
Webmaster: kamweb.mff.cuni.cz Modified: 19. 10. 2010