报告题目：On majority coloring of digraphs
报告人：蔡建生
报告时间：2025年9月21日9:00-10:00
报告地点：科技园阳光楼南815
邀请单位：91暗网
、离散数学及其应用省部共建教育部重点实验室
报告内容简介：
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 
, 
-majority coloring of a directed graph is a vertex-coloring in which every vertex 
has the same color as at most 
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 
-majority coloring of digraphs.
报告人简介：
蔡建生，潍坊91暗网91暗网
教授，中国工业与应用数学学会图论组合及其应用专业委员会常务委员、中国工业与应用数学学会信息和通讯领域的数学专业委员会委员、山东省数学会高等数学专业委员会常务理事、潍坊市五一劳动奖章获得者。长期从事图论和组合数学的研究，发表本专业学术论文80余篇，主持和参与国家自然科学基金项目多项，主持山东省自然科学基金项目多项。获得山东省自然科学奖一项，获得山东省高等学校优秀科研成果奖多项。
