DMS Combinatorics Seminar

Speaker: Jie Ma (University of Science and Technology of China)

Title: On extremal problems on k-critical graphs

Abstract: A graph is called k-critical if its chromatic number is k but any proper subgraph has chromatic number less than k. There has been extensive research on k-critical graphs over the past decades, yet several basic problems remain widely open. One of such problems is to determine the maximum number of edges in an n-vertex k-critical graph. In this talk, we will discuss some recent results on extremal aspects of k-critical graphs.