On March 9, 2021, Debsoumya Chakraborti from the IBS Discrete Mathematics Group gave a talk explaining his two results on the graph saturation problem jointly with Po-Shen Loh. The title of his talk was “Some classical problems in graph saturation“.

## Debsoumya Chakraborti gave a talk on finding a rainbow matching in an edge-colored graph at the Discrete Math Seminar

On December 1, 2020, Debsoumya Chakraborti from the IBS Discrete Mathematics Group presented his theorem with Po-Shen Loh about the existence of a rainbow matching of size q in a simple graph whose edges are colored properly by 2q+o(q) colors. The title of his talk was “Rainbow matchings in edge-colored simple graphs“.

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