Strongly balanced graphs and random graphs
Strongly balanced graphs and random graphs
复制标题
强平衡图和随机图
DOI：
10.1002/jgt.3190100214
复制
发表时间：
1986
期刊：
影响因子：
--
通讯作者：
A. Vince
中科院分区：
文献类型：
--
作者：
A. Rucinski;A. Vince
引入强平衡图的概念。结果表明，当且仅当 I ν – 1 ⩽ e ⩽() 时，存在一个有 v 个顶点和 e 个边的强平衡图。这个结果应用于 Erdos 和 Renyi 的一个经典问题：n 个顶点上的随机图包含给定图的概率是多少？此问题的根版本也已解决。
The concept of strongly balanced graph is introduced. It is shown that there exists a strongly balanced graph with v vertices and e edges if and only if I ν – 1 ⩽ e ⩽(). This result is applied to a classic question of Erdos and Renyi: What is the probability that a random graph on n vertices contains a given graph? A rooted version of this problem is also solved.