### Tianchi Yang, On the maximum number of edges in k-critical graphs

Room B332 IBS (기초과학연구원)In this talk, we will discuss the problem of determining the maximum number of edges in an n-vertex k-critical graph. A graph is considered k-critical if its chromatic number is k, but any proper subgraph has a chromatic number less than k. The problem remains open for any integer k ≥ 4. Our presentation will …