Speaker: Guo He, postdoctoral fellow, Faculty of Mathematics, Technion-Israel Institute of Technology

Date: May 11, 2023

Time: 15：00-16：00

Location: Tencent Meeting

Sponsor: Research Center for Mathematics and Interdisciplinary Sciences

Research Center for Nonlinear Expectation

Abstract:

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).

For more information, please visit:

https://www.view.sdu.edu.cn/info/1020/179130.htm