arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.03359math.CO
收藏

随机图中的大诱导匹配

Large induced matchings in random graphs

Oliver Cooley, Nemanja Draganić, Mihyun Kang, Benny Sudakov

摘要:

给定一个大的图$H$,二项式随机图$G(n,p)$是否以高概率包含$H$的一个拷贝作为诱导子图?这个经典的问题已经被广泛研究了各种图$H$,可以追溯到研究的独立数$G(n,p)$的Erdés和Bollobás,和Matula在1976年。本文证明了诱导匹配的一个渐近最佳可能结果:如果对某个大常数$C$有$C/n\le p \le 0.99$,则$G(n,p)$包含近似$2\log_q(np)$阶的诱导匹配,其中$q= \frac{1}{1-p}$ .

英文摘要:

Given a large graph $H$, does the binomial random graph $G(n,p)$ contain a copy of $H$ as an induced subgraph with high probability? This classical question has been studied extensively for various graphs $H$, going back to the study of the independence number of $G(n,p)$ by Erdős and Bollobás, and Matula in 1976. In this paper we prove an asymptotically best possible result for induced matchings by showing that if $C/n\le p \le 0.99$ for some large constant $C$, then $G(n,p)$ contains an induced matching of order approximately $2\log_q(np)$, where $q= \frac{1}{1-p}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑