报告题目：Rainbow structures in graph systems

报告人：王光辉 山东大学

报告时间：2021/07/27 18:30-20:30

地点：点击链接入会，或添加至会议列表：

https://meeting.tencent.com/s/5H7iqF53mcWd

会议 ID：904 493 513

摘要：

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 prove the asymptotic rainbow version of Hajnal-Szemeredi Theorem in graph systems. We in fact provides a general framework to attack this type of problems.