Beijing Institute of Mathematical Sciences and Applications

Jie Ma , Benjamin Sudakov

Jie Han

Tuesday, March 17, 2026 5:05 PM - 6:15 PM

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 is a professor at the School of Mathematics and Statistics of Beijing Institute of Technology. He obtained his Ph. D. degree in 2015 at Georgia State University under the supervision of Prof. Yi Zhao. He then spent his academic life at the University of Sao Paulo (Brazil), University of Birmingham (UK), University of Rhode Island (USA), until he joined BIT in 2022. His research interests are Extremal Combinatorics, Graph Theory and Theoretical Computer Science.