Upcoming Events
Monday, February 3, 2020
4:00 PM
|
Sequoia Hall 200
Sumit Mukherjee (Columbia)
Tuesday, February 4, 2020
4:00 PM
|
Math 383-N
David Jordan (University of Edinburgh)
Tuesday, February 4, 2020
4:00 PM
|
Math 384-H
Wednesday, February 5, 2020
4:30 PM
|
Math 384-H
Alexei Novikov, Pennsylvania State University
Wednesday, February 5, 2020
4:30 PM
|
Math 384-I
Thursday, February 6, 2020
2:00 PM
|
Math 384-H
Yuval Wigderson (Stanford)
Perhaps the biggest open problem in graph Ramsey theory is to determine the asymptotic growth rate of the Ramsey numbers of the clique . For this problem, the lower and upper bounds of 2^{r/2} and 4^r, respectively, have remained essentially unchanged for over 70 years. One promising approach…