ON THE MAXIMUM NUMBER OF QUALITATIVELY INDEPENDENT PARTITIONS

被引：34

作者：

POLJAK, S ^{[1
]}

TUZA, Z ^{[1
]}

机构：

[1] HUNGARIAN ACAD SCI, INST COMP & AUTOMAT, H-1111 BUDAPEST, HUNGARY

来源：

关键词：

D O I：

10.1016/0097-3165(89)90081-2

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：111 / 116

页数：6

共 11 条

ALON, N .

[2] ON GENERALIZED GRAPHS [J].

BOLLOBAS, B .

ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1965, 16 (3-4) :447-&

[3]

FRIEDMAN J, 1984, IEEE S FDN COMPUTER, P506

[4]

Katona G., 1973, PERIOD MATH HUNG, V3, P19

[5]

Khasin L. S., 1970, Soviet Physics - Doklady, V14, P1149

[6]

Kleiman M., 1978, Theoretical Computer Science, V7, P325, DOI 10.1016/0304-3975(78)90021-X

[7]

KLEITMAN DJ, 1975, DISCRETE MATH, V13, P255

[8] ON QUALITATIVELY INDEPENDENT PARTITIONS AND RELATED PROBLEMS [J].

POLJAK, S ;

PULTR, A ;

RODL, V .

[9]

Poljak S., 1980, CZECH MATH J, V30, P475, DOI [10.21136/CMJ.1980.101696, DOI 10.21136/CMJ.1980.101696]

[10]

RENYI A, 1971, F PROBABILITY