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

Welcome Rutger Campbell and Debsoumya Chakraborti, new members of IBS Discrete Mathematics Group

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.

Debsoumya Chakraborti received his Ph.D. from the Program of Algorithms, Combinatorics, and Optimization at the Carnegie Mellon University in 2020 under the supervision of Prof. Po-Shen Loh. He is interested in extremal combinatorics, probabilistic combinatorics, and random graphs.

IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 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
Copyright © IBS 2018. All rights reserved.