Optimal threshold for a random graph to be 2-universal

Author:

Ferber Asaf,Kronenberg Gal,Luh Kyle

Abstract

For a family of graphs F \mathcal {F} , a graph G G is F \mathcal {F} -universal if G G contains every graph in F \mathcal {F} as a (not necessarily induced) subgraph. For the family of all graphs on n n vertices and of maximum degree at most two, H ( n , 2 ) \mathcal {H}(n,2) , we prove that there exists a constant C C such that for p C ( log n n 2 ) 1 3 , p \geq C \left ( \frac {\log n}{n^2} \right )^{\frac {1}{3}}, the binomial random graph G ( n , p ) G(n,p) is typically H ( n , 2 ) \mathcal {H}(n,2) -universal. This bound is optimal up to the constant factor as illustrated in the seminal work of Johansson, Kahn, and Vu for triangle factors. Our result improves significantly on the previous best bound of p C ( log n n ) 1 2 p \geq C \left (\frac {\log n}{n}\right )^{\frac {1}{2}} due to Kim and Lee. In fact, we prove the stronger result that for H ( n , 2 ) \mathcal {H}^{\ell }(n,2) , the family of all graphs on n n vertices, of maximum degree at most two and of girth at least \ell , G ( n , p ) G(n,p) is typically H ( n , 2 ) \mathcal H^{\ell }(n,2) -universal when p C ( log n n 1 ) 1 . p \geq C \left (\frac {\log n}{n^{\ell -1}}\right )^{\frac {1}{\ell }}. This result is also optimal up to the constant factor. Our results verify (in a weak form) a classical conjecture of Kahn and Kalai.

Funder

National Science Foundation

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Reference39 articles.

1. Sparse universal graphs;Alon, Noga;J. Comput. Appl. Math.,2002

2. Sparse universal graphs for bounded-degree graphs;Alon, Noga;Random Structures Algorithms,2007

3. Optimal universal graphs with deterministic embedding;Alon, Noga,2008

4. Universality and tolerance (extended abstract);Alon, Noga,2000

5. Near-optimum universal graphs for graphs with bounded degrees (extended abstract);Alon, Noga,2001

Cited by 11 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. On oriented cycles in randomly perturbed digraphs;Combinatorics, Probability and Computing;2023-11-08

2. Cycles of every length and orientation in randomly perturbed digraphs;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023

3. Triangles in randomly perturbed graphs;Combinatorics, Probability and Computing;2022-07-05

4. Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs;Random Structures & Algorithms;2021-10-14

5. Thresholds versus fractional expectation-thresholds;Annals of Mathematics;2021-09-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3