| Date | Nov 11, 2014 | 
|---|---|
| Speaker | Endre Szemerédi | 
| Dept. | Rutgers University | 
| Room | 129-101 | 
| Time | 15:30-16:30 | 
The idea of the method is that
we don't have to work that hard. This roughly means that we first construct a
so-called "absorbing" configuration, and after that we only need to
solve the problem "almost". We're going to give examples from both
graph and hypergraph theory.