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 条

[31] Self-complementary factors of almost complete tripartite graphs of even order
Froncek, D
DISCRETE MATHEMATICS, 2001, 236 (1-3) : 111 - 122
[32] Decomposition of almost complete tripartite graphs into two isomorphic factors of fixed diameter
Eischen, Ellen E.
DISCRETE MATHEMATICS, 2006, 306 (8-9) : 745 - 761
[33] Dense periodicity on graphs
Yokoi, Katsuya
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS, 2007, 37 (06) : 2077 - 2088
[34] Almost surely almost exact optimization in random graphs
Faragó, A
FCS '05: Proceedings of the 2005 International Conference on Foundations of Computer Science, 2005, : 94 - 100
[35] DENSE COMPOUND GRAPHS
GOMEZ, J
FIOL, MA
ARS COMBINATORIA, 1985, 20A : 211 - 237
[36] On nowhere dense graphs
Nesetril, Jaroslav
Ossona de Mendez, Patrice
EUROPEAN JOURNAL OF COMBINATORICS, 2011, 32 (04) : 600 - 617
[37] Dense graphs are antimagic
Alon, N
Kaplan, G
Lev, A
Roditty, Y
Yuster, R
JOURNAL OF GRAPH THEORY, 2004, 47 (04) : 297 - 309
[38] A NOTE ON ALMOST REGULAR GRAPHS
HOFMEISTER, M
MATHEMATISCHE NACHRICHTEN, 1994, 166 : 259 - 262
[39] Almost Hamiltonian Cubic Graphs
Punnim, Narong
Saenpholphat, Varaporn
Thaithae, Sermsri
INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2007, 7 (01): : 83 - 86
[40] Detecting almost symmetries of graphs
Knueven, Ben
Ostrowski, Jim
Pokutta, Sebastian
MATHEMATICAL PROGRAMMING COMPUTATION, 2018, 10 (02) : 143 - 185

← 1 2 3 4 5 →