Speaker:Xu Baogang, Professor, School of Mathematical Sciences, Nanjing Normal University

Date:April 15, 2019

Time:9:00 am-10:00 am

Location:Lecture Hall 1032, Block B, Zhixin Building, Central Campus

Sponsor:Professor Wang Guanghui, School of Mathematics

Abstract:

In 1996, Stiebitz 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δ(G[S])≥s andδ(G[T])≥t. Then, some Stiebitz's type theorems 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 problems on this topic.

Bio:

Xu Baogang, professor and doctoral supervisor of Nanjing Normal University, received his PhD in Operations Research and Cybernetics from Shandong University in 1997. He was Postdoctoral fellow of Academy of Mathematics and Systems Science, CAS. His research interests lie in Graph Theory and Combinatorial Optimization.

For more information, please visit:

http://www.view.sdu.edu.cn/info/1020/116329.htm

Edited by: Sun Yangyang