Syllabus and Topics
Schedule of Speakers and Topics:
September 6: Jacob Fox, Chromatic number and clique subdivisions.
September 9: Yufei Zhao, Shannon capacity of the union.
September 11: Rik Sengupta, Coloring hypergraphs.
September 13: Miriam Farber, The Stanley-Wilf conjecture.
September 16 Jesse Geneson, An extension of the Stanley-Wilf conjecture.
September 18: Chiheon Kim, On a problem of Erdos and Rothschild on edges in triangles.
September 20: No class.
September 23: Aaron Potechin, Quasirandom permutations.
September 25: Francisco Unda, Equitable colorings and the Hajnal-Szemeredi theorem.
September 27: Davie Rolnick, On a conjecture of Erdos on Ramsey numbers.
September 30: Miriam Farber, Equal Entries in Totally Positive Matrices.
October 2: Miriam Farber, On Totally Positive Matrices and Geometric Incidences.
October 4: Department Retreat - No class.
October 7: Andrey Grinshpun, Independent sets in hypergraphs.
October 9: Andrey Grinshpun, Independent sets in hypergraphs.
October 11: Andrey Grinshpun, Independent sets in hypergraphs.
October 14: Columbus Day - No class.
October 16: Amol Aggarwal, Stanley-Wilf limits are typically exponential.
October 18: Peter Csikvari.
October 21: Yufei Zhao, A quasi-polynomial bound for the Freiman-Ruzsa theorem.
October 23: Yufei Zhao, A quasi-polynomial bound for the Freiman-Ruzsa theorem.
October 25: Yufei Zhao, A quasi-polynomial bound for the Freiman-Ruzsa theorem.
October 28: Charles River Lectures on Probability Theory and Related Topics in E51 MIT Tang Center.
October 30: Yufei Zhao, A quasi-polynomial bound for the Freiman-Ruzsa theorem.
November 2: Davie Rolnick, List coloring hypergraphs.
November 4: Amol Aggarwal, A New Upper Bound for Diagonal Ramsey Numbers.
November 6: Amol Aggarwal, A New Upper Bound for Diagonal Ramsey Numbers.
November 8: Jesse Geneson, Davenport-Schinzel sequences and applications.
November 11: Veterans Day - No class.
November 13: Jesse Geneson, Davenport-Schinzel sequences and applications.
November 18: Francisco Unda, Graph sparsification.
November 20: Francisco Unda, Graph sparsification.
November 22: Francisco Unda, Graph sparsification.
November 25: Rik Sengupta, Maximizing the number of independent sets of a fixed size.
November 27: Laszlo Miklos Lovasz, Color-critical graphs.
December 2: Laszlo Miklos Lovasz, Color-critical graphs.
December 4: Laszlo Miklos Lovasz, Color-critical graphs.
December 6: Chiheon Kim, A disproof of the Alon-Saks-Seymour conjecture.
December 9: Rik Sengupta, The triangle-free process.
December 9: Aaron Potechin, Even Cycles and Quasi-Random Tournaments.
December 11: Davie Rolnick, The triangle-free process. 2 hours.