Colouring random Hasse diagrams and box-Delaunay graphs
组织者
本杰明·苏达科夫
演讲者
Matthew Kwan
时间
2025年04月15日 17:05 至 18:15
地点
Online
线上
Zoom 787 662 9899
(BIMSA)
摘要
Consider a d-dimensional poset P on n elements, and consider its Hasse diagram G(P). How large can the chromatic number of G(P) be? What if P is random? We discuss some new results in these directions, in particular obtaining essentially-best-possible estimates for random low-dimensional posets, and resolving a conjecture of Tomon. Joint work with Zhihan Jin
and Lyuben Lichev.
and Lyuben Lichev.
演讲者介绍
Matthew Kwan completed his PhD on extremal and probabilistic combinatorics under the supervision of Benny Sudakov at ETH Zurich. Since then, he has continued working on combinatorics and its connections to probability. After an appointment as Szegő Assistant Professor at Stanford University, he is currently an Assistant Professor at the Institute for Science and Technology in Austria.