ALMOST H-FACTORS IN DENSE GRAPHS

被引：37

作者：

ALON, N ^{[1
]}

YUSTER, R ^{[1
]}

机构：

[1] TEL AVIV UNIV,RAYMOND & BEVERLY SACKLER FAC EXACT SCI,DEPT MATH,IL-69978 TEL AVIV,ISRAEL

来源：

GRAPHS AND COMBINATORICS | 1992年 / 8卷 / 02期

关键词：

D O I：

10.1007/BF02350627

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The following asymptotic result is proved. For every fixed graph H with h vertices, any graph G with n vertices and with minimum degree d greater-than-or-equal-to chi(H) - 1/chi(H) n contains (1 - o(1))n/h vertex disjoint copies of H.

引用

页码：95 / 102

页数：8