报告人：张闫博
报告时间：2023年8月2日10:00--11:00
腾讯会议ID：674-313-602
报告主题：Two conjectures on online Ramsey numbers
主 办：数学与统计学院、离散数学及其应用省部共建教育部重点实验室
报告摘要：
Given two graphs G and H, the online Ramsey number ˜r(G,H) is defined as the minimum number of rounds in which Builder can always guarantee a win in the (G,H)-online Ramsey game against Painter. The game starts with an infinite set of isolated vertices, and in each round, Builder draws a new edge between two vertices. Painter then immediately colors the edge either red or blue. Builder’s objective is to force either a red copy of G or a blue copy of H in as few rounds as possible, while Painter aims to delay this outcome for as many rounds as possible. This talk presents new results on online Ramsey numbers that validate the conjecture proposed by Latip and Tan, as well as the conjecture posed by Cyman, Dzido, Lapinskas, and Lo.
报告人简介：
张闫博，河北师范大学副教授，硕士研究生导师。西北工业大学本科，南京大学硕博连读，荷兰特文特大学联合培养，波兰密茨凯维奇大学访问学者，曾任教中南大学。主持和主研国家自然科学基金三项，在JCTB等杂志发表论文近二十篇。
