# 学术报告（许宝刚 11.30）

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

-

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日