一、报告题目

Prague dimension of random graphs

二、主讲人

郭赫

三、报告时间

2023年5月11日 15：00—16：00

四、报告地点

腾讯会议

五、摘要

He Guo is a postdoctoral fellow at Faculty of Mathematics at Technion - Israel Institute of Technology. His current research lies in the intersection of combinatorics and probability theory.

六、主讲人简介

The Prague dimension of graphs was introduced by Nesetril, Pultr and Rodl in the 1970s. Proving a conjecture of Furedi and Kantor, we show that the Prague dimension of the binomial random graph is typically of order n/log n for constant edge-probabilities. The main new proof ingredient is a Pippenger-Spencer type edge-coloring result for random hypergraphs with large uniformities, i.e., edges of size O(log n).

七、主办单位

非线性期望前沿科学中心

数学与交叉科学研究中心