A RANDOM GRAPH WITH A SUBCRITICAL NUMBER OF EDGES

被引:0
作者
PITTEL, B [1 ]
机构
[1] OHIO STATE UNIV, DEPT MATH, COLUMBUS, OH 43210 USA
关键词
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:51 / 75
页数:25
相关论文
共 23 条
[1]   THE LONGEST PATH IN A RANDOM GRAPH [J].
AJTAI, M ;
KOMLOS, J ;
SZEMEREDI, E .
COMBINATORICA, 1981, 1 (01) :1-12
[2]   POISSON CONVERGENCE AND RANDOM GRAPHS [J].
BARBOUR, AD .
MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1982, 92 (SEP) :349-359
[3]  
Berge C., 1971, PRINCIPLES COMBINATO
[4]  
Bollob\as B., 1984, GRAPH THEORY COMBINA, P59
[5]   LONG PATHS IN SPARSE RANDOM GRAPHS [J].
BOLLOBAS, B .
COMBINATORICA, 1982, 2 (03) :223-228
[6]  
Bollobas B, 2001, RANDOM GRAPHS, V73
[7]   A note on the theory of moment generating functions [J].
Curtiss, JH .
ANNALS OF MATHEMATICAL STATISTICS, 1942, 13 :430-433
[8]  
ERDOS P, 1960, B INT STATIST INST, V38, P343
[9]  
Erdos P, 1959, PUBL MATH-DEBRECEN, V6, P290, DOI DOI 10.2307/1999405
[10]  
Fernandez de la Vega W., 1979, STUD SCI MATH HUNG, V14, P335