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

共 50 条

[21] Almost self-complementary factors of complete bipartite graphs
Froncek, D
DISCRETE MATHEMATICS, 1997, 167 : 317 - 327
[22] Range of of diameters of complementary factors almost complete tripartite graphs
Froncek, D
UTILITAS MATHEMATICA, 2000, 57 : 211 - 225
[23] Uniform Generation of d-Factors in Dense Host Graphs
Pu Gao
Graphs and Combinatorics, 2014, 30 : 581 - 589
[24] Uniform Generation of d-Factors in Dense Host Graphs
Gao, Pu
GRAPHS AND COMBINATORICS, 2014, 30 (03) : 581 - 589
[25] Almost universal graphs
Frieze, Alan
Krivelevich, Michael
RANDOM STRUCTURES & ALGORITHMS, 2006, 28 (04) : 499 - 510
[26] H (n)-factors in random graphs
Yan, Yun-Zhi
Wang, Han-Xing
Wang, Jun
Yin, Xiang-Feng
STATISTICS & PROBABILITY LETTERS, 2008, 78 (11) : 1255 - 1258
[27] On almost hypohamiltonian graphs
Goedgebeur, Jan
Zamfirescu, Carol T.
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2019, 21 (04):
[28] Almost all graphs and h-hypergraphs have small diameter
Tomescu, Joan
AUSTRALASIAN JOURNAL OF COMBINATORICS, 2005, 31 : 313 - 323
[29] DELAUNAY GRAPHS ARE ALMOST AS GOOD AS COMPLETE GRAPHS
DOBKIN, DP
FRIEDMAN, SJ
SUPOWIT, KJ
DISCRETE & COMPUTATIONAL GEOMETRY, 1990, 5 (04) : 399 - 407
[30] ANTIGENIC STUDY OF SERRATIA-MARCESCENS ISOLATED IN FRANCE .1. ANTIGENS - INDIVIDUALIZATION OF 6 NEW H-FACTORS
LEMINOR, S
PIGACHE, F
ANNALES DE MICROBIOLOGIE, 1977, B128 (02): : 207 - 214

← 1 2 3 4 5 →