JUDICIOUS PARTITIONS OF HYPERGRAPHS

Citation
B. Bollobas et Ad. Scott, JUDICIOUS PARTITIONS OF HYPERGRAPHS, J COMB TH A, 78(1), 1997, pp. 15-31
Citations number
19
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
JOURNAL OF COMBINATORIAL THEORY SERIES A
ISSN journal
00973165 → ACNP
Volume
78
Issue
1
Year of publication
1997
Pages
15 - 31
Database
ISI
SICI code
0097-3165(1997)78:1<15:JPOH>2.0.ZU;2-4
Abstract
We prove the asymptotically best possible result that, for every integ er k greater than or equal to 2, every 3-uniform graph with m edges ha s a vertex-partition into k sets such that each set contains at most ( 1 + o(1))m/k(3) edges. We also consider related problems and conjectur e a more general result. (C) 1997 Academic Press.