講座主題：On majority coloring of digraphs
專(zhuān)家姓名：蔡建生
工作單位：濰坊學(xué)院
講座時(shí)間：2025年06月12日 14:00-16:00
講座地點(diǎn)：數(shù)學(xué)學(xué)院大會(huì)議室341
主辦單位：煙臺(tái)大學(xué)數(shù)學(xué)與信息科學(xué)學(xué)院
內(nèi)容摘要：
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.
主講人介紹：
蔡建生，理學(xué)博士，現(xiàn)任濰坊學(xué)院數(shù)學(xué)與信息科學(xué)學(xué)院教授、中國(guó)工業(yè)與應(yīng)用數(shù)學(xué)學(xué)會(huì)圖論組合及應(yīng)用專(zhuān)業(yè)委員會(huì)常務(wù)委員、中國(guó)工業(yè)與應(yīng)用數(shù)學(xué)學(xué)會(huì)信息和通訊領(lǐng)域的數(shù)學(xué)專(zhuān)業(yè)委員會(huì)委員、山東師范大學(xué)和濟(jì)南大學(xué)碩士生導(dǎo)師。發(fā)表相關(guān)學(xué)術(shù)論文60余篇，先后數(shù)次獲得國(guó)家自然科學(xué)基金面上項(xiàng)目資助、山東省自然科學(xué)三等獎(jiǎng)1項(xiàng)、山東省高校優(yōu)秀科研成果多項(xiàng)，2021年獲得濰坊市五一勞動(dòng)獎(jiǎng)?wù)隆?/p>
