On September 15, 2020, Debsoumya Chakraborti from the IBS Discrete Mathematics Group presented a talk on the extremal problem on the number of cliques in a graph of small maximum degree with a fixed number of edges. The title of his talk was “Maximum number of cliques in a graph with bounded maximum degree“.
Generalized extremal problems have been one of the central topics of study in extremal combinatorics throughout the last few decades. One such simple-looking problem, maximizing the number of cliques of a fixed order in a graph with a fixed number of vertices and given maximum degree, was recently resolved by Chase. Settling a conjecture of Kirsch and Radcliffe, we resolve the edge variant of this problem, where the number of edges is fixed instead of the number of vertices. This talk will be based on joint work with Da Qi Chen.
The IBS discrete mathematics group welcomes Dr. Rutger Campbell and Dr. Debsoumya Chakraborti, new research fellows at the IBS discrete mathematics group from August 16, 2020.
Rutger Campbell received his Ph.D. from the Department of Combinatorics and Optimization at the University of Waterloo in 2020 under the supervision of Prof. Jim Geelen. He is interested in matroid theory and structural graph theory.