学术报告

当前位置:学术交流 >> 学术报告 >> 浏览文章

学术报告:Chromatic polynomials of hypergraphs

发布时间:2017年12月27日 浏览次数:发布者:mathky

报告人:董峰明副教授

新加坡南洋理工大学

报告题目:Chromatic polynomials of hypergraphs

报告时间:20171229日下午17:00

报告地点:海韵实验楼105

摘要:For any graph G, the chromatic polynomial of G is a function P such that P(G; k) is the number of proper k-colourings of G for any positive integer k. This graph-function for planar graphs was originally introduced by George David Birkho_ in 1912 to attack the four color problem. Hassler Whitney generalised it from the planar case to general graphs in 1932. In 1968 Read asked which polynomials are the chromatic polynomials of some graphs, a question that remains open, and some other questions. Today, chromatic polynomial is one of the central objects of algebraic graph theory. The graph-function P graphs was extended to the case for hypergraphs in 1970s. In this talk the author will explain some of their new results on the chromatic polynomial of hypergraphs

报告人简介:新加坡南洋理工大学副教授,国际著名的色根研究专家。新加坡国立大学博士,曾在新西兰和加拿大从事研究工作。主要研究图多项式,尤其擅长色多项式的研究,近年开始从事拟阵论和纽结研究。现已发表研究论文60多篇,很多发表在组合论国际顶尖刊物JCTB,出版专著一部(F.M. Dong, K.M. Koh, K.L. Teo, Chromatic polynomials and chromaticity of graphs, World Scientific, Singapore, 2005.)。由于在色根的研究方面的出色成果,董教授曾应邀到英国剑桥大学工作访问并作主旨发言。

学院联系人:金贤安教授

欢迎广大师生参加!