报告题目：On extremal problems on k-critical graphs
报告人：马杰教授（中国科学技术大学）
报告时间：2023年5月26日10:30-11:30
报告地点：理科楼A404
报告摘要：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. This is based on some joint works with Jun Gao, Cong Luo and Tianchi Yang.
报告人简介：马杰，中国科学技术大学数学科学学院教授、博导。主要从事组合图论领域的研究工作及其在理论计算机和信息科学中的应用。入选海外高层次人才青年项目、基金委国家优青项目、杰青项目；曾获中国工业与应用数学学会应用数学青年科技奖、国际组合学及其应用协会2020年Hall Medal等奖项，现任美国工业与应用数学学会离散数学杂志编委。
邀请人：陆玫
