The perturbation thresholds of degenerate graphs
组织者
马杰
, 本杰明·苏达科夫
演讲者
Jie Han
时间
2026年03月17日 17:05 至 18:15
地点
Online
线上
Zoom 787 662 9899
(BIMSA)
摘要
The randomly perturbed model was introduced by Bohman, Frieze and Martin in 2003, which interpolates the Dirac-type problems on minimum degree conditions and the same subgraph containment problem in random graphs $G(n,p)$. In this talk we will briefly survey known results and explain our recent work on embedding degenerate graphs in the randomly perturbed model. Indeed, the threshold of d-degenerate graph containment is known to be $n^{-1/d}$, and we show that the randomly perturbed threshold is $n^{-1/d-o(1)}$, that is, we obtain a saving polynomial in n.
演讲者介绍
Jie Han obtained his PhD degree from Georgia State University (US) in 2015 under the supervision of Prof. Yi Zhao. He then held postdoc positions at the University of São Paulo and University of Birmingham, until he took a tenure-track position at the University of Rhode Island in 2018. He joined Beijing Institute of Technology as a full professor in 2022. His research interests include extremal graph theory and extremal combinatorics.