Mathematical Computer Science Seminar
Haoran Luo
UIC
Generalized Erdős--Rogers functions
Abstract: The Erdős–Rogers function f_{K_s, K_t}(n) is defined as the minimum possible value of the s-independence number over all n-vertex K_t -free graphs. Introduced by Erdős and Rogers in 1962, it has since become an important topic in Ramsey theory, with numerous papers achieving significant improvements on the bounds for various pairs (s, t). In this talk, we will discuss two recent generalizations of the Erdős–Rogers function: the multicolor case and the case of arbitrary pairs of graphs. We will also present some open problems.
Monday September 22, 2025 at 3:00 PM in 1227 SEO