Debsoumya Chakraborti gave a talk on the problem of maximizing the number of cliques in a graph of small maximum degree at the Discrete Math Seminar

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