LARGE INDUCED TREES IN SPARSE RANDOM GRAPHS

被引:15
作者
FRIEZE, AM [1 ]
JACKSON, B [1 ]
机构
[1] UNIV LONDON GOLDSMITHS COLL,DEPT MATH,LONDON SE14 6NW,ENGLAND
关键词
D O I
10.1016/0095-8956(87)90039-6
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:181 / 195
页数:15
相关论文
共 11 条
[1]   LONG PATHS IN SPARSE RANDOM GRAPHS [J].
BOLLOBAS, B .
COMBINATORICA, 1982, 2 (03) :223-228
[2]  
BOLLOBAS B, GRAPH THEORY COMBINA, P59
[3]  
Bollobas B, 1980, EUR J COMBINAT, V1, P311
[4]   TREES IN RANDOM GRAPHS [J].
ERDOS, P ;
PALKA, Z .
DISCRETE MATHEMATICS, 1983, 46 (02) :145-150
[5]  
ERDOS P, 1960, B INT STATIST INST, V38, P343
[6]  
Erdos P., 1974, PROBABILISTIC METHOD
[7]  
FERNADEZDELAVEG.W, 1985, CNRS214 RES REP
[8]  
FRIEZE AM, UNPUB LARGE HOLES SP
[10]   THE LARGEST TREE IN A RANDOM GRAPH [J].
MARCHETTISPACCAMELA, A ;
PROTASI, M .
THEORETICAL COMPUTER SCIENCE, 1983, 23 (03) :273-286