讲座主题：On majority coloring of digraphs

专家姓名：蔡建生

工作单位：潍坊学院

讲座时间：2025年06月12日 14:00-16:00

讲座地点：数学学院大会议室341

主办单位：烟台大学数学与信息科学学院

内容摘要：

A majority coloring of a directed graph is a vertex-coloring in which every vertex has the same color as at most half of its out-neighbors. Kreutzer et al. conjectured that every digraph is majority 3-colorable.For an integer $k\geq 2$, $\frac{1}{k}$-majority coloring of a directed graph is a vertex-coloring in which every vertex $v$ has the same color as at most $\frac{1}{k}d^+(v)$ of its out-neighbors.In this talk, we give a survey on the results about Kreutzer's conjecture, and gave some new results which improves Kreutzer's results, also we obtained some results of $\frac{1}{k}$-majority coloring of digraphs.Moreover, we discuss the majority 3-coloring of random digraphs with some conditions.

主讲人介绍：

蔡建生，理学博士，现任潍坊学院数学与信息科学学院教授、中国工业与应用数学学会图论组合及应用专业委员会常务委员、中国工业与应用数学学会信息和通讯领域的数学专业委员会委员、山东师范大学和济南大学硕士生导师。发表相关学术论文60余篇，先后数次获得国家自然科学基金面上项目资助、山东省自然科学三等奖1项、山东省高校优秀科研成果多项，2021年获得潍坊市五一劳动奖章。