Maximum Induced Trees in Sparse Random Graphs

IF 0.5 4区数学 Q3 MATHEMATICS

Doklady Mathematics Pub Date : 2024-05-13 DOI:10.1134/s1064562424701989

J. C. Buitrago Oropeza

引用次数: 0

Abstract

We prove that for any \(\varepsilon > 0\) and \({{n}^{{ - \frac{{e - 2}}{{3e - 2}} + \varepsilon }}} \leqslant p = o(1)\) the maximum size of an induced subtree of the binomial random graph \(G(n,p)\) is concentrated asymptotically almost surely at two consecutive points.

查看原文本刊更多论文

稀疏随机图中的最大诱导树

AbstractWe prove that for any \(\varepsilon > 0\) and\({{n}^{ - \frac{{e - 2}}{{3e - 2}})+ \varepsilon }}}\二项式随机图 \(G(n,p)\) 的诱导子树的最大尺寸几乎肯定地集中在两个连续点上。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Doklady Mathematics 数学-数学

CiteScore

1.00

自引率

16.70%

发文量

审稿时长

3-6 weeks

期刊介绍： Doklady Mathematics is a journal of the Presidium of the Russian Academy of Sciences. It contains English translations of papers published in Doklady Akademii Nauk (Proceedings of the Russian Academy of Sciences), which was founded in 1933 and is published 36 times a year. Doklady Mathematics includes the materials from the following areas: mathematics, mathematical physics, computer science, control theory, and computers. It publishes brief scientific reports on previously unpublished significant new research in mathematics and its applications. The main contributors to the journal are Members of the RAS, Corresponding Members of the RAS, and scientists from the former Soviet Union and other foreign countries. Among the contributors are the outstanding Russian mathematicians.