学术活动

报告题目：On the stability of chromatic thresholds

主讲人：薛益赛

报告时间：10月19日 9:30-10:00

报告地点：西安电子科技大学南校区会议中心B101报告厅

The chromatic threshold of  a graph  is the infimum of   such that there exists a constant   depending only on   and  , for which the chromatic number of every  -vertex   -free graph with minimum degree at least   is bounded by . Allen, B  ttcher, Griffiths, Kohayakawa, and Morris remarkably determined the chromatic threshold for every  ; in particular, they showed that if   then .

We show that there are three families of extremal graphs, each corresponding to one value of   listed above, such that every  -vertex  -free graph with sufficiently large minimum degree $   and chromatic number $    must be structurally close to one member of these extremal graphs.

薛益赛，宁波大学讲师，博士毕业于上海大学，师从康丽英教授。曾于2023年4月-2024年4月访问韩国基础科学研究院(IBS)极值组合与概率组(ECOPRO)刘鸿教授。研究方向为极值组合，谱图理论，图论等，在JCTB，DM等期刊发表论文多篇。