A Lecture by Xu Baogang on "Some results and problems of graph partitions with degree constraints"
Home  |  Sitemap  |  Contact Us  |  中文

Home >  Bulletin

A Lecture by Xu Baogang on "Some results and problems of graph partitions with degree constraints"
DateandTime: 2014-07-02 14:38:33

Speaker: Xu Baogang, Nanjing Normal University

Date: July 4, 2014

Time: 9:30 a.m.

Location: Room B924,Zhixin Buiding, Central Campus


Abstract: In 1996, Stiebitz confirmed a conjecture of Thomassen and proved that, for any nonnegative integers $s$ and $t$, every graph $G$ with minimum degree at least $s+t+1$ admits a bipartition $S, T$ such that $\delta(G[S])\geq s$ and $\delta(G[T])\geq t$. In this talk, we will present some results and problems related to Stiebitz’s theorem.

 

 

For further information, please visit:

http://www.maths.sdu.edu.cn/some-results-and-problems-of-graph-partitions-with-degree-constraints.html




 Copyright 2011 © All rights reserved, Network Center, Shandong University    |    englishweb@sdu.edu.cn