题目：Cooperative colorings
报告人：Zilin Jiang (Department of Mathematics, Massachusetts Institute of Technology)
报告人：Zilin Jiang (Department of Mathematics, Massachusetts Institute of Technology)
时间：6月19号（周三）下午4:00-5:00
地点：五教5305
地点：五教5305
摘要：
A new notion of graph coloring will be introduced in this talk: Given a system of graphs $G_1, /dots, G_m$ on the same vertex set V, a cooperative coloring is a partition of the vertex set with parts $I_1, /dots, I_m$ such that $I_j$ is independent in $G_j$. Heuristically this new notion is in-between the usual coloring and the existence of independent transversals satisfying a certain "locality" constraint.
A new notion of graph coloring will be introduced in this talk: Given a system of graphs $G_1, /dots, G_m$ on the same vertex set V, a cooperative coloring is a partition of the vertex set with parts $I_1, /dots, I_m$ such that $I_j$ is independent in $G_j$. Heuristically this new notion is in-between the usual coloring and the existence of independent transversals satisfying a certain "locality" constraint.
