MATH Seminar

Title: Uniform Hypergraphs Containing no Grids
Seminar: Combinatorics
Speaker: Miklos Ruszinko of Hungarian Academy of Science and Memphis University
Contact: Andrzej Rucinski, andrzej@mathcs.emory.edu
Date: 2013-04-15 at 3:00PM
Venue: MSC W303
Download Flyer
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