报告题目：Improved upper bound for the degenerate and star coloring chromatic numbers of graphs

报告摘要：Let G = G(V,E) be a graph. A proper coloring of G is a function

f : V → N such that f(x) ≠ f(y) for every edge xy ∈ E. A proper coloring of a graph G such that for every k ≥ 1, the union of any k color classes induces a

(k-1)-degenerate subgraph is called a degenerate coloring; a proper coloring of a graph with no two-colored is called a star coloring. If a coloring is both degenerate and star, then we call it a degenerate star coloring of graph. The corresponding chromatic number is denoted as . We employ entropy compression method to obtain a new upper bound of (G) for general graph G.

报告时间：2016年9月3日（周六）下午14：30-15：30

报告地点：教学二楼2126

欢迎老师和同学参加！

报告人简介： 蔡建生，潍坊学院数学与信息科学学院教授，中国运筹学会图论组合分会理事、山东省数学会高等数学专业委员会常务理事、美国《数学评论》评论员和美国数学会会员，《International Journal of Digital Content Technology and its Applications》和《Advances and Applications in Discrete Mathematics》编委。1989年毕业于山东大学数学系运筹学专业，2007于山东大学数学院获得运筹学与控制论博士学位。主要从事图论和组合优化的研究工作，在《Science China Mathematics》、《Discrete Mathematics》、《Discrete Applied Mathematics》、《 Journal of Combinatorial Optimization》等杂志发表论文40余篇，主持和参与国家自然科学基金4项，主持山东省自然科学基金3项。