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.