报告人：许宝刚 教授（南京师范大学）


报告时间：2022年10月9日(周日)  19：00-20：00


腾讯会议：156-833-575


报告摘要： In 1996, Stiebitz confirmed a conjecture of Thomassen and proved that for any nonnegative integers s and t, if a graph G has minimum degree at least s+t+1 then V(G) can be partitioned into two subsets which induce  subgraphs with minimum degree at least s and t respectively. In this talk, I will introduce the history, Stiebits’ type results and still open problems related to partitions of graphs under minimum degree (resp. connectivity) constraints.


邀请人：季利均 教授