COVERINGS OF R-GRAPHS BY COMPLETE R-PARTITE SUBGRAPHS

Authors
ERDOS P RODL V
Citation
P. Erdos et V. Rodl, COVERINGS OF R-GRAPHS BY COMPLETE R-PARTITE SUBGRAPHS, Random structures & algorithms, 6(2-3), 1995, pp. 319-322
Citations number
7
Categorie Soggetti
Mathematics,Mathematics,Mathematics,"Computer Science Software Graphycs Programming
Journal title
Random structures & algorithms → ACNP
ISSN journal
10429832
Volume
6
Issue
2-3
Year of publication
1995
Pages
319 - 322
Database
ISI
SICI code
1042-9832(1995)6:2-3<319:CORBCR>2.0.ZU;2-0
Abstract
Let G be an (r + 1)-uniform hypergraph of n vertices, let f(r + 1, G) denote the minimum number of complete (r + 1)-partite subgraphs necess ary to cover all edges of G. We note that f(r + 1, G) less than or equ al to T(r, r + 1, n); the corresponding Turan number, and prove that u p to a factor of 1 + o(1) this bound is best possible. (C) 1995 John W iley and Sons, Inc.