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
{"title":"Maximum Induced Trees in Sparse Random Graphs","authors":"J. C. Buitrago Oropeza","doi":"10.1134/s1064562424701989","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>We prove that for any <span>\\(\\varepsilon &gt; 0\\)</span> and <span>\\({{n}^{{ - \\frac{{e - 2}}{{3e - 2}} + \\varepsilon }}} \\leqslant p = o(1)\\)</span> the maximum size of an induced subtree of the binomial random graph <span>\\(G(n,p)\\)</span> is concentrated asymptotically almost surely at two consecutive points.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2024-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Doklady Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1134/s1064562424701989","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 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.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
稀疏随机图中的最大诱导树
AbstractWe prove that for any \(\varepsilon > 0\) and\({{n}^{ - \frac{{e - 2}}{{3e - 2}})+ \varepsilon }}}\二项式随机图 \(G(n,p)\) 的诱导子树的最大尺寸几乎肯定地集中在两个连续点上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Doklady Mathematics
Doklady Mathematics 数学-数学
CiteScore
1.00
自引率
16.70%
发文量
39
审稿时长
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.
期刊最新文献
New Cases of Integrable Ninth-Order Conservative and Dissipative Dynamical Systems The Set of Banach Limits and Its Discrete and Continuous Subsets Sufficient Condition for Polynomial Solvability of Random 3-CNF Formulas Methods for Tracking an Object Moving in $${{\mathbb{R}}^{3}}$$ under Conditions of Its Counteraction Construction of an Artificial Neural Network for Solving the Incompressible Navier–Stokes Equations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1