Title: Hypergraph Ramsey Numbers
Abstract: The Ramsey number r(H,K) of two graphs H and K is the smallest integer N such that when the edges of the complete graph on N vertices are colored red and blue, there is either a red copy of H or a blue copy of K. Computing the asymptotics of Ramsey numbers is an important open problem, with significant progress in the past year. I will be discussing the generalization of this problem to hypergraphs, where even less is known. Based on joint work with David Conlon, Jacob Fox, Xiaoyu He, Dhruv Mubayi, Andrew Suk, and Jacques Verstraete.
Join Zoom Meeting
Meeting ID: 870 2292 5697