.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
In this note we shall study random labelled graphs. Denote bythe set of all graphs with n given labelled vertices andM(n)edges. As usual, we turn(M(n))into a probability space by giving all graphs the same probability. The question we address ourselves to is the following. Given a graphHand a constant p, 0 < p < 1, for what functionsM(n)is it true that the probability PM(n)(H ⊂ G) that a graphG∈(M(n))containsHtends topas n∞→? This question was posed by Erdös and Rényi (3), (4), who also proved several beautiful and surprising theorems. In order to state the main general result of Erdös and Rényi in this direction, and for our use later, we introduce some definitions.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
暂无期刊信息
机构
暂无机构信息
引用论文
暂无论文信息