Recent advances on extremal problems of k-critical graphs (Jie Ma, University of Science and Technology of China)

Graph Theory Seminar
Tuesday, February 27, 2024 - 3:30pm for 1 hour (actually 50 minutes)
Skiles 006
Jie Ma – University of Science and Technology of China –
Evelyne Smith-Roberge

 A graph is called k-critical if its chromatic number is k but any proper subgraph has chromatic number less than k. There have been extensive reseaches 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, including improvments on the extremal number of edges/cliques/critical subgraphs in k-critical graphs.  This is based on some joint works with Jun Gao, Cong Luo and Tianchi Yang.