报告题目： Vertex partition with average degree constraint

 
报告人： 吴河辉 研究员  复旦大学/上海数学中心
 
报告时间: 2018年11月11日上午8:30-9:30
 
报告地点: 精正楼307教室
 

报告摘要: A classical result showed by Stiebitz in 1996 stated that a graph with minimum degree s+t+1 contains a vertex partition (A, B),  G[A] has minimum degree at least s and G2 has minimum degree at least t.

 

Motivated by this result, it was conjectured that for any non- negative real number s and t, such that if G is a non-null graph with average degree at least s + t + 2, then there exist a vertex partition (A, B) such that G[A] has average degree at least s and G[B] has average degree at least t.

 

With Yan Wang at Facebook, we fully proved the conjecture.