
- This event has passed.
Debsoumya Chakraborti, Some classical problems in graph saturation
Tuesday, March 9, 2021 @ 4:30 PM - 5:30 PM KST
Graph saturation is one of the oldest areas of investigation in extremal combinatorics. A graph
In the first half of the talk, we will discuss a generalization of Erdős-Hajnal-Moon theorem (1964), which determined the value of
In the second half, we will focus on a central conjecture in graph saturation made by Tuza (1986), which states that for every graph
This talk will be based on a joint work with Po-Shen Loh.