报告时间：2024年6月20日 20:00开始
报 告 人：Andrew Treglown（伯明翰大学 教授）
报告地点：Zoom Meeting ID: 879 3812 8369
Passcode: 202889
报告题目： Tilings in graphs
报告摘要： Given two graphs H and G, an H-tiling in G is a collection of vertex disjoint copies of H in G. Thus, an H-tiling is simply a generalisation of the notion of a matching (which corresponds to the case when H is an edge). An H-tiling in G is perfect if every vertex of G is covered by the H-tiling. Over the last 60 years there have been numerous results on perfect H-tilings. In this talk we give a high-level overview of some of the key ideas that permeate the topic. In particular, we will discuss some typical behaviour of extremal examples.
报告人简介：Andrew Treglown，英国伯明翰大学（University of Birmingham）数学学院教授。博士毕业于伯明翰大学,师从Daniela Kühn教授和Deryk Osthus教授夫妇（均为ICM报告人）。当前研究兴趣为组合数学（尤其是极值与概率组合、Ramsey理论）及其在数论、代数等领域的应用。在Memoirs of the American Mathematical Society、Journal of the European Mathematical Society、Journal of Combinatorial Theory Series B等著名期刊上发表论文40多篇。多次获得EPSRC项目资助。2021年获得美国数学会与美国数学优化学会联合颁发的富尔克森奖（Fulkerson Prize）。
