DEGREE SEQUENCES OF RANDOM GRAPHS

被引：77

作者：

BOLLOBAS, B ^{[1
]}

机构：

[1] MATH INST, AARHUS, DENMARK

来源：

关键词：

D O I：

10.1016/0012-365X(81)90253-3

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：1 / 19

页数：19

共 21 条

[1] GRAPHS WITH EQUAL EDGE CONNECTIVITY AND MINIMUM DEGREE [J].

BOLLOBAS, B .

[2] UNIQUELY COLORABLE GRAPHS WITH LARGE GIRTH [J].

BOLLOBAS, B ;

SAUER, N .

CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1976, 28 (06) :1340-1344

[3] CHROMATIC NUMBER, GIRTH AND MAXIMAL DEGREE [J].

BOLLOBAS, B .

[4]

BOLLOBAS B, 1977, J LOND MATH SOC, V16, P403

[5]

BOLLOBAS B, 1976, MATH PROC CAMBRIDGE, V80, P419, DOI 10.1017/S0305004100053056

[6]

Bollobas B., 1978, EXTREMAL GRAPH THEOR

[7] GRAPH THEORY AND PROBABILITY .2. [J].

ERDOES, P .

CANADIAN JOURNAL OF MATHEMATICS, 1961, 13 (02) :346-&

[8]

ERDOS P, 1977, J COMB THEORY B, V23, P255, DOI 10.1016/0095-8956(77)90039-9

[9]

ERDOS P, 1960, B INT STATIST INST, V38, P343

[10]

ERDOS P, 1974, PROBABILITY METHODS