Jun Gao gave a talk about the tight upper bound on the number of (k-1)-cliques in a k-critical graph at the Discrete Math Seminar

On August 30, 2022, Jun Gao (高峻) from the IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar about the tight upper bound on the number of (k-1)-cliques in a k-critical graph, solving the conjecture of Abbott and Zhou in 1992. The title of his talk was “Number of (k-1)-cliques in k-critical graph“.