报告题目：Brooks’ type theorem for indicated coloring game
报告人：Kenta Ozeki (Yokohama National University)
报告时间：2024年5月29日（周三）15：00-16:00
报告地点：20-200
报告摘要：An indicated coloring game on a graph G is a variant of a coloring game, which is played by two players, Ann and Ben, with a fixed color set. In each round, Ann indicates an uncolored vertex and then Ben assigns to the vertex a color that has not been assigned to any of its neighbors. Ann aims to achieve a proper coloring of G, while Ben tries to prevent this. The minimum number of colors required for Ann to win the indicated coloring game on a graph $G$ is denoted by $χ_i(G)$. In this talk, we give a conjecture for a conneted graph $G$ to have $χ_i(G) \leq \Delta(G)$, and give some partial answers.
报告人简介：Kenta Ozeki(小关键太),1982年生，2009年毕业于日本庆应大学（Keio University），现为日本横浜国立大学副教授。Ozeki教授主要研究方向为图论，包括哈密尔顿圈，哈密尔顿路，支撑树。他是Graphs and Combinatorics，Theory and Applications of Graphs和Journal of Algebra Combinatorics Discrete Structures and Applications的编委。他在Combinatorics,JCTB, JCTA,CPC,SIDMA，JGT，SODA等杂志和会议期刊上发表论文110余篇。
邀请人：朱绪鼎