On October 8, 2021, Paul Seymour from Princeton University gave an online talk at the Virtual Discrete Math Colloquium on the polynomial ๐-boundedness of graph classes. The title of his talk was “Polynomial bounds for chromatic number“.

Skip to content
# Paul Seymour gave an online talk on the polynomial ๐-boundedness of graph classes at the Virtual Discrete Math Colloquium

On October 8, 2021, Paul Seymour from Princeton University gave an online talk at the Virtual Discrete Math Colloquium on the polynomial ๐-boundedness of graph classes. The title of his talk was “Polynomial bounds for chromatic number“.