|国家预印本平台
首页|Concentration of the maximum size of an induced subtree in moderately sparse random graphs

Concentration of the maximum size of an induced subtree in moderately sparse random graphs

Concentration of the maximum size of an induced subtree in moderately sparse random graphs

来源:Arxiv_logoArxiv
英文摘要

Kamaldinov, Skorkin, and Zhukovskii proved that the maximum size of an induced subtree in the binomial random graph $G(n,p)$ is concentrated at two consecutive points, whenever $p\in(0,1)$ is a constant. Using improved bounds on the second moment of the number of induced subtrees, we show that the same result holds when $n^{-\frac{e-2}{3e-2}+\varepsilon}\leq p=o(1)$.

Juan Carlos Buitrago Oropeza

数学

Juan Carlos Buitrago Oropeza.Concentration of the maximum size of an induced subtree in moderately sparse random graphs[EB/OL].(2025-07-03)[2025-07-25].https://arxiv.org/abs/2506.02801.点此复制

评论