报告人：David Conlon教授，加州理工学院
报告时间：2023年2月14日9:00--12:00
Zoom ID：401 168 6043（密码FZULQZ）
或者通过以下链接加入Zoom会议https://us02web.zoom.us/j/4011686043?pwd=dnk0ZmZ6MGEvUjE3S2tUUkxBd1RYZz09
报告主题：Recent progress on size Ramsey numbers
主 办：数学与统计学院、离散数学及其应用省部共建教育部重点实验室
报告摘要：
The size Ramsey number of a graph H is the smallest number of edges in a graph G with the property that every two-colouring of the edges of G contains a monochromatic copy of H. In this talk, we will discuss recent progress on several classical questions about size Ramsey numbers. For instance, what is the size Ramsey number of the complete bipartite graph K_{s,t}? And what is the size Ramsey number of a graph with maximum degree three? Parts of this talk represent joint work with Rajko Nenadov and Milos Trujic and also with Jacob Fox and Yuval Wigderson.
