报告题目：proper orientation and proper chromatic number

报告人：陈耀斌

报告时间：2024年11月5日15:00-17:00

报告地点：腾讯会议859295236

邀请单位：福州大学数学与统计学院

报告内容简介：

The proper chromatic number of a graphGis the minimumksuchthat there exists an orientation of the edges ofGwith all vertex-outdegrees at mostkand such that for any adjacent vertices, the outdegrees are different. Two major conjectures about the proper chromatic number are resolved. First it is shown, that the proper chromatic number of any planar graphGis bounded (in fact, it is at most 14). Secondly, it is shown that for every graph, the proper chromatic number can be bounded by a function of the usual chromatic number and the maximum average degree taken over all subgraphs of G. Several other related results are derived. Our proofs are based on a novel notion of fractional orientations. This is joint work with Bojan Mohar and Hehui Wu.

报告人简介：

陈耀斌，复旦大学上海数学中心博士四年级研究生，导师为吴河辉老师。主持国家自然科学基金青年博士研究生基础研究项目，目前已在JCTB，Combinatorica上发表若干篇论文。

欢迎感兴趣的师生参与讨论！