报告人： 杨东雷教授
报告时间：2024年1月24日10:00--12:00
腾讯会议ID：786-771-750
报告主题：A Ramsey-Turan theory for tilings in graphs
主 办：数学与统计学院、离散数学及其应用省部共建教育部重点实验室
报告摘要：
A central topic in Ramsey–Turan theory, initiated by Erdos and Sos, is to determine RT(n; H; o(n)), the maximum number of edges an n-vertex graph G can have, provided that α(G) = o(n) and G contains no copy of H. For a k-vertex graph F and a graph G, an F-tiling is a collection of vertex-disjoint copies of F in G. A perfect F-tiling covers the vertex set of G, which is a fundamental object in graph theory with a wealth of results from various aspects. Motivated by the Ramsey-Turn theory, a recent trend has focused on reducing the minimum degree condition forcing the existence of F-factors in graphs by adding an extra condition that provides pseudorandom properties. In this talk, we mainly investigate the effect of imposing the condition that α(G) = o(n) by studying the minimum degree thresholds for Kk-tilings. Similar questions for powers of Hamilton cycles are also considered.
报告人简介：
杨东雷，2020年博士毕业于山东大学数学学院，曾到佐治亚理工学院访问一年。目前是山东大学齐鲁青年学者。主要研究方向包括图染色，Ramsey-Turan理论，伪随机理论等。目前已在Combinatorica, JCTB, RSA, JGT及EUJC等国际期刊发表论文多篇。
