报告人：陈冠涛教授

        Department of Mathematics and Statistics,

        Georgia State University

报告题目：Graph Edge Coloring - from local to global structure

报告时间：2016年06月28日下午15:30

报告地点：海韵实验楼108

学院联系人:张莲珠教授

报告摘要：Graph Edge Coloring problem, the determine the edge chromatic index of a graph, is a unique classic NP-hard problem.  The exact value and the known approximated value are different only by the multiplicity of the graph.  In particular, it is bounded by 1 for multiplicity graphs.  In this talk, we give a survey of recent results surrounding the well-known Goldberg’s Conjecture.  These are based on a joint work with Yuping Gao and Songling Shan.

报告人简介：Guantao Chen is a Distinguished University Professor of Mathematics at Georgia State University. He is currently served as the Chair of the Department of Mathematics and Statistics.  His research areas lie in graph theory and its applications.  He has published more than 100 papers including solving a few long standing conjectures in his field.

欢迎广大师生参加！