- Research Horizons Seminar
- Wednesday, November 14, 2018 - 12:20 for 1 hour (actually 50 minutes)
- Skiles 005
- Prasad Tetali – Georgia Tech
There has been much interest in the past couple of decades in identifying (extremal) regular graphs that maximize the number of independent sets, matchings, colorings etc. There have been many advances using techniques such as the fractional subaddtivity of entropy (a.k.a. Shearer's inequality), the occupancy method etc. I will review some of these and mention some open problems on hypergraphs.