## 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“.

기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209