ON THE NUMBER OF EDGE DISJOINT CLIQUES IN GRAPHS OF GIVEN SIZE

被引：13
|
作者：
GYORI, E [1 ]
机构：
[1] HUNGARIAN ACAD SCI,INST MATH,H-1364 BUDAPEST,HUNGARY
来源：
COMBINATORICA | 1991年 / 11卷 / 03期
关键词：
AMS code classification (1980): 05C35;
D O I：
10.1007/BF01205075
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper, we prove that any graph of n vertices and t(r-1)(n) + m edges, where t(r-1)(n) is the Turan number, contains (1 - omicron-(1))m edge disjoint K(r')s if m = omicron-(n2). Furthermore, we determine the maximum m such that every graph of n vertices and t(r-1)(n) + m edges contains m edge disjoint K(r)'s if n is sufficiently large.
引用
收藏
页码：231 / 243
页数：13
相关论文
共 50 条
12345