题目：Rainbow disconnection of graphs
报告人：南开大学 李学良 教授
摘要：Let $G$ be an edge-colored connected graph. An edge-cut $R$ of $G$ is called a rainbow cut if no two edges in $R$ are colored with a same color. An edge-colored graph $G$ is called rainbow disconnected if for every pair of vertices $u$ and $v$ of $G$, there exists a $u-v$ rainbow cut in $G$ separating them. For a connected graph $G$, the rainbow disconnection number of $G$, denoted by $rd(G)$, is defined as the smallest number of colors that are needed in order to make $G$ rainbow disconnected. In this talk we will summarize the main results on this new graph parameter. Some open questions are also presented.
This is a joint work with my students Xuqing Bai et al.