勷勤数学•专家报告

题      目：Some open problems on chromatic polynomials

报  告  人：董峰明  教授  (邀请人：周波)

                                    新加坡南洋理工大学

时      间：12月12日  15：30-16：30

地     点：数科院东楼二楼会议室

报告人简介:

       1997年于新加坡国立大学获博士学位，任教于南洋理工大学，是国际著名的图论特别是图多项式领域的专家。

摘      要：

       The chromatic polynomial of a graph $G$, denoted by $P(G,\lambda)$, is the polynomial which counts the number of proper $\lambda$-colorings of $G$ whenever $\lambda$ is a positive integer. In this talk, I will introduce some open problems on chromatic polynomials. The talk will include some fundamental literature of chromatic polynomials and current status of the study of these open problems.

         欢迎老师、同学们参加、交流！