DISJOINT TRIPLES IN A 3-GRAPH WITH GIVEN MAXIMAL DEGREE

被引：6

作者：

BOLLOBAS, B ^{[1
]}

机构：

[1] UNIV CALGARY,CALGARY T2N 1N4,ALBERTA,CANADA

来源：

关键词：

D O I：

10.1093/qmath/28.1.81

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：81 / 85

页数：5

共 9 条

[1]

BERGE C, 1958, CR HEBD ACAD SCI, V247, P258

BOLLOBAS, B ;

ELDRIDGE, SE .

[3] SETS OF INDEPENDENT EDGES OF A HYPERGRAPH [J].

BOLLOBAS, B ;

DAYKIN, DE ;

ERDOS, P .

[4]

BOLLOBAS B, TO BE PUBLISHED

[5]

CHVATAL V, 1972, DEGREES MATCHINGS

[6]

Erdos Paul, 1960, J LONDON MATH SOC, V35, P85

[7]

SAUER N, 1971, COMBINATORIAL MATH I, P253

[8]

Tutte W. T., 1947, J LOND MATH SOC, V22, P107, DOI DOI 10.1112/JLMS/S1-22.2.107

[9] ON NUMBER OF DISJOINT EDGES IN A GRAPH [J].

WEINSTEIN, JM .

CANADIAN JOURNAL OF MATHEMATICS, 1963, 15 (01) :106-&