2,000+ Free Courses with Certificates: Coding, AI, SQL, and More
Free courses from frontend to fullstack and AI
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
This lecture explores the chromatic number of Hasse diagrams in d-dimensional posets, with a focus on random posets. Learn about new results that provide essentially-best-possible estimates for random low-dimensional posets and the resolution of Tomon's conjecture. The speaker, Matthew Kwan, is an Assistant Professor at the Institute for Science and Technology in Austria who specializes in extremal and probabilistic combinatorics. His presentation, delivered at BIMSA, represents joint work with Zhihan Jin and Lyuben Lichev, examining the maximum possible chromatic number of Hasse diagram G(P) for a d-dimensional poset P on n elements.
Syllabus
Matthew Kwan: Colouring random Hasse diagrams and box-Delaunay graphs
Taught by
BIMSA