Loading Events

« All Events

  • This event has passed.

Debsoumya Chakraborti, Maximum number of cliques in a graph with bounded maximum degree

September 15 Tuesday @ 4:30 PM - 5:30 PM KST

Room B232, IBS (기초과학연구원)

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.


September 15 Tuesday
4:30 PM - 5:30 PM KST
Event Category:
Event Tags:


Room B232
IBS (기초과학연구원)


Sang-il Oum (엄상일)