学术报告|
当前位置:首页 > 科研 > 学术报告
发表时间:2019-10-08 阅读次数:169次
报告题目: COLORING GRAPHS WITH NO K5-SUBDIVISION
报 告 人:Qiqin Xie
报告人所在单位:Shanghai Center for Mathematical Sciences
报告日期:2019-10-08 星期二
报告时间:14:10-14:40
报告地点:2201 East Main Guanghua Tower
  
报告摘要:

Hajós conjectured every graph with no Kn+1-subdivision is n-colorable. The conjecture is true for n ≤ 3. However, Catlin disproved the conjecture for n ≥ 6. It remains open for n = 4 and 5. In this talk, I will introduce the motivation and background of the chromatic number problem on graphs with no K5-subdivision. I will propose the plan of my future works regarding this problem. Some of my previous works related to the problem will also be mentioned.

海报

  
本年度学院报告总序号:207

Copyright © |2012 复旦大学数学科学学院版权所有 沪ICP备042465  

电话:+86(21)65642341 传真:+86(21)65646073