报告题目：Graph dichotomy - a personal perspective
报告人：Professor Pavol Hell，西蒙弗雷泽大学
报告时间：2026年9月18日（周五）15:00-16:00
报告地点：20-200
报告摘要：In 1990, Jarik Nesetril and the speaker classified all homomorphism problems as polynomial or NP-complete. This dichotomy theorem has been reproved several times since, and was one of the main motivations for the CSP dichotomy conjecture of Feder and Vardi, now verified by Bulatov and (independently) Zhuk. In this talk I will describe the background, history, and my recollections of how the result came about.
报告人简介：Pavol Hell，西蒙弗雷泽大学教授，2012年美国工业与应用数学学会（SIAM）会士，曾任《Journal of Graph Theory》执行主编，与长期合作者Jaroslav Nešetřil合著了专著《Graphs and Homomorphisms》。
邀请人：朱绪鼎