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 条

[11]

Harary F., 1973, GRAPHICAL ENUMERATIO

[12] PROBABILITY OF INDECOMPOSABILITY OF A RANDOM MAPPING FUNCTION [J].

KATZ, L .

ANNALS OF MATHEMATICAL STATISTICS, 1955, 26 (03) :512-517

[13]

MOON JW, 1970, CANADIAN MATH CONGRE

[14] ON THE NUMBER OF DISTINCT BLOCK SIZES IN PARTITIONS OF A SET [J].

ODLYZKO, AM ;

RICHMOND, LB .

[15] PATHS IN A RANDOM DIGITAL TREE - LIMITING DISTRIBUTIONS [J].

PITTEL, B .

PITTEL, B .

[17]

Renyi A., 1967, J AUSTRAL MATH SOC, V7, P497, DOI DOI 10.1017/S1446788700004432

[18]

Renyi A, 1959, MAGYAR TUDOMANYOS AK, V4, P73

[19] THE ENUMERATION OF TREES BY HEIGHT AND DIAMETER [J].

RIORDAN, J .

[20]

SACHKOV VN, 1978, PROBABILISTIC METHOD