Combinatorics Seminar
Miklos Ruszinko
Renyi Institute and Memphis
Uniform Hypergraphs Containing no Grids
Abstract: A hypergraph is called an $r\times r$ {\em grid} if it is isomorphic to a pattern of
$r$ horizontal and $r$ vertical lines, i.e.,
a family of sets $\{A_1, \dots ,A_r, B_1,\dots ,B_r\}$ such that
$A_i\cap A_j=B_i\cap B_j=\emptyset$ for $1\le i
Monday October 19, 2015 at 3:00 PM in SEO 427