摘要: The Four Color Theorem (4CT) states that every planar graph is 4-colorable. We will mention results and problems related to 4CT, and discuss several problems that attempts to generalize 4CT.
报告人：郁星星教授， Georgia Institute of Technology
时间地点： 5月22日 10：30-11：30 研楼 307