Time: 2019-05-26 10：00-11：00

Venue: Room 201 Lecture Hall

Abstract:

In 1996, Stirbitz confirmed a conjecture of Thomassen and proved that every graph of minimum degree at least $s+t+1$ has a partition $(S, T)$ such that $\delta(G[S])\ge s$ and $\delta(G[T])\ge t$. Then, some Stiebitz's type theorem appear on special families of graphs. Recently, Schweser and Stiebitz consider the analogous problem of multigraphs (multiedges are permitted), and generalize some conclusions from simple graphs to multigraphs. In this talk, we will present some recent progresses and still open problem on this topic.