一、报告题目：T[-1]-cluster tilting objects in triangulated categories Balanced coloring of signed graphs
二、报告人：Reza Naserasr 教授
三、时 间：2025年12月6日(周六) 14:00-15:00
四、地 点：闻理园A4-305
报告摘要：Balanced coloring of a signed graph is a partition of its vertices into balanced sets; those are sets which do not induce a negative cycle. The minimum number of colors needed for a balanced coloring of a signed graph $(G,\sigma)$ is called its \emph{balanced chromatic number}, denoted $\chi_{_b}(G,\sigma)$. Balanced chromatic number of a signed graph is sandwiched between the chromatic number of the subgraph induced by the negative edges and the arboricity of the underlying graph. This talk will serve as an introduction to the notion. I will review what is known and will present some open problems.
报告人简介：Reza Naserasr教授于2004年获加拿大温哥华Simon Fraser大学博士学位，后于法国Bordeaux大学、加拿大Carleton大学和Waterloo大学做博士后研究，现任法国CNRS研究员（Université Paris Cité），主要研究图的染色和图的同态。
欢迎广大师生参加！ 联系人：胡晓雪
