学术报告(许宝刚 11.30)

离散数学学术报告--Partitions of graphs under minimum degree constraints: results and open problems

发布人:周妍 发布日期:2018-11-08
主题
离散数学学术报告--Partitions of graphs under minimum degree constraints: results and open problems
活动时间
-
活动地址
新数学楼416
主讲人
许宝刚 教授(南京师范大学)

摘要:

Stiebitz (1996) confirmed a conjecture of Thomassen and proved that for nonnegative integers $s$ and $t$, every graph of minimum degree $s+t+1$ admits a partition $(S, T)$ such that $\delta(G[S])\ge s$ and $\delta(G[T])\ge t$.

In this talk, we will introduce some results and still open problems on this topic.

 

数学学院

2018年11月8日