Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Colouring Random Hasse Diagrams and Box-Delaunay Graphs

BIMSA via YouTube

Overview

Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
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

Reviews

Start your review of Colouring Random Hasse Diagrams and Box-Delaunay Graphs

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.