THE NUMBER OF MAXIMAL INDEPENDENT SETS IN CONNECTED GRAPHS

被引：74

作者：

FUREDI, Z

机构：

来源：

关键词：

D O I：

10.1002/jgt.3190110403

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：463 / 470

页数：8

共 10 条

[1]

Bollobas B., 1974, Discrete Mathematics, V8, P21, DOI 10.1016/0012-365X(74)90105-8

[2]

de Caen D., 1985, C NUMER, V47, P249

[3] A NEW GENERALIZATION OF THE ERDOS-KO-RADO THEOREM [J].

FRANKL, P ;

FUREDI, Z .

[4]

Frankl P., 1984, EUROP J COMBINATORIC, V5, P127

[5]

GRIGGS JR, IN PRESS DISCRETE MA

[6]

KATONA GOH, 1974, MATH CTR TRACTS, V56, P13

[7] ON CLIQUES IN GRAPHS [J].

MOON, JW ;

MOSER, L .

[8]

SIDORENKO AF, UDK, V519, P1

[9]

Turan P., 1941, MAT FIZ LAPOK, V48, P436

[10] THE NUMBER OF MAXIMAL INDEPENDENT SETS IN A TREE [J].

WILF, HS .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1986, 7 (01) :125-130