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“.
κΈ°μ΄κ³Όνμ°κ΅¬μ μ΄μ°μνκ·Έλ£Ή
