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

无钻石工艺

The diamond-free process

Michael E. Picollelli

摘要:

令K_4^-表示从完全图K_4中去掉一条边而形成的钻石图。我们考虑以下随机图过程:从n个孤立顶点开始,随机均匀地添加边,只要没有这样的边创建K_4^-的副本。我们表明,随着概率趋于1的$n \to \infty$,产生的图的最终大小是$Θ(\sqrt{\log(n)} \cdot n^{3/2})$。我们的分析还表明,i边添加后产生的图类似于随机图,具有不位于三角形上的边形成随机子图的附加条件。

英文摘要:

Let K_4^- denote the diamond graph, formed by removing an edge from the complete graph K_4. We consider the following random graph process: starting with n isolated vertices, add edges uniformly at random provided no such edge creates a copy of K_4^-. We show that, with probability tending to 1 as $n \to \infty$, the final size of the graph produced is $Θ(\sqrt{\log(n)} \cdot n^{3/2})$. Our analysis also suggests that the graph produced after i edges are added resembles the random graph, with the additional condition that the edges which do not lie on triangles form a random-looking subgraph.

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

↑