ON LARGE MATCHINGS AND CYCLES IN SPARSE RANDOM GRAPHS

被引：31
作者：
FRIEZE, AM [1 ]
机构：
[1] CARNEGIE MELLON UNIV,PITTSBURGH,PA 15213
来源：
DISCRETE MATHEMATICS | 1986年 / 59卷 / 03期
关键词：
D O I：
10.1016/0012-365X(86)90171-8
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：243 / 256
页数：14
相关论文
共 12 条
  • [1] THE LONGEST PATH IN A RANDOM GRAPH
    AJTAI, M
    KOMLOS, J
    SZEMEREDI, E
    [J]. COMBINATORICA, 1981, 1 (01) : 1 - 12
  • [2] Bollob\as B., 1984, GRAPH THEORY COMBINA, P59
  • [3] LONG PATHS IN SPARSE RANDOM GRAPHS
    BOLLOBAS, B
    [J]. COMBINATORICA, 1982, 2 (03) : 223 - 228
  • [4] BOLLOBAS B, UNPUB ANN DISCRETE M
  • [5] ON EXISTENCE OF A FACTOR OF DEGREE 1 OF A CONNECTED RANDOM GRAPH
    ERDOS, P
    RENYI, A
    [J]. ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1966, 17 (3-4): : 359 - +
  • [6] ON THE EXISTENCE OF HAMILTONIAN CYCLES IN A CLASS OF RANDOM GRAPHS
    FENNER, TI
    FRIEZE, AM
    [J]. DISCRETE MATHEMATICS, 1983, 45 (2-3) : 301 - 305
  • [7] Fernandez de la Vega W., 1979, STUD SCI MATH HUNG, V14, P335
  • [8] Karp R. M., 1981, 22nd Annual Symposium on Foundations of Computer Science, P364, DOI 10.1109/SFCS.1981.21
  • [9] KOMLOS J, 1982, DISCRETE MATH, V43, P55
  • [10] KORSHUNOV A., 1976, SOV MATH DOKL, V17, P760
12