Speaker: Yangyang Cheng is currently a postdoctoral researcher at the University of Passau in Germany. He obtained his Ph.D. from the University of Oxford in the United Kingdom, under the supervision of Peter Keevash. His research focuses primarily on structural graph theory and extremal graph theory. He has published several papers in journals such as Forum of Mathematics, Sigma, Journal of Combinatorial Theory, Series A, and SIAM Journal on Discrete Mathematics.

Date: March 31, 2025

Time: 9:30-11:30 am

Location: E119, Huagang East Building, Shandong University Qingdao Campus

Sponsor: Research Center for Mathematics and Interdisciplinary Sciences, Shandong University

Abstract:

Graph embedding is a major branch of extremal combinatorics. The main goal is to find a spanning subgraph H within a large dense graph G under certain degree conditions. We will introduce classic results and recent progress in graph embedding theory, as well as the main techniques commonly used, such as the absorption method and the regularity-blow-up method. Furthermore, we will present the main conjectures in this field and their variants.

For more information, please visit:

https://www.view.sdu.edu.cn/info/1020/200534.htm