Random Graph Theorems
Random Graph Theorems
复制标题
随机图定理
DOI：
10.1007/978-94-010-9910-3_21
复制
发表时间：
1977
影响因子：
1
通讯作者：
G. Grimmett
中科院分区：
文献类型：
--
作者：
G. Grimmett
在较早的论文[3]中，我和我研究了n个顶点上一个随机图的色数，其中每个边缘都存在，并以规定的概率p独立于存在或不存在其他边缘。这样的随机图不同于Erdos和Renyi在其论文[1]中在随机图的演变中考虑的图形，因为它们对N（N）边缘的N顶点上的图很感兴趣，其中N是一个规定的函数，每个N-SUBSET在可能的边缘的集合中以同样的概率发生。他们指出，两种方法之间没有根本区别。
In an earlier paper [3] McDiarmid and I studied the chromatic number of a random graph on n vertices in which each edge is present with a prescribed probability p independently of the presence or absence of the other edges. Such random graphs differ from those which Erdos and Renyi considered in their paper [1] on the evolution of random graphs, for they were interested in graphs on n vertices with N(n) edges where N is a prescribed function and each N-subset of the set of possible edges occurs with equal probability. They noted that there is no essential difference between the two approaches.