On March 16, 2023, Paul Seymour from Princeton University gave an online talk at the Virtual Discrete Math Colloquium on the existence of a clique or an independent set of size at least $2^{c\sqrt{\log n \log \log n}}$ in an $H$-free graph. The title of his talk was “A loglog step towards the Erdős-Hajnal conjecture.”