Speaker: Sha Yetong: I'm a MSc student at the Institute for Advanced Study in Mathematics, Harbin Institute of Technology. Previously, I completed my undergraduate studies at the School of Mathematics, also at Harbin Institute of Technology. My research interests lie broadly in discrete probability and probabilistic combinatorics.

Date: July 6, 2025

Time: 19:00-20:00 pm

Location: Tencent Meeting: 517 692 117 (Password: 202507)

Sponsor: School of Mathematics, Shandong University

Abstract:

We determine the sharp threshold for the containment of all n-vertex trees of bounded degree in random geometric graphs with n vertices. This provides a geometric counterpart of Montgomery's threshold result for binomial random graphs, and confirms a conjecture of Espuny Díaz, Lichev, Mitsche, and Wesolek. Our proof is algorithmic and adapts to other families of graphs, in particular graphs with bounded genus or tree-width.

For more information, please visit:

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