Rainbow structures in graph systems（图的彩虹结构）
报告人：王光辉教授（山东大学数学学院）
报告时间：2021年8月18日（周三）19:00
参会方式：腾讯会议
会议ID：892 356 896
邀请人：袁西英
报告摘要：We study the rainbow version of subgraph containment problems in a family of graphs, which generalizes the classical subgraph containment problems in a single host graphs. More precisely, we provethe asymptotic rainbow version of Hajnal-Szemeredi Theorem in graph systems. We in fact provide a general framework to attack this type of problems.