Judicious Partitions of Hypergraphs

We prove the asymptotically best possible result that, for every integerk⩾2, every 3-uniform graph withmedges has a vertex-partition intoksets such that each set contains at most (1+o(1)) m/k3edges. We also consider related problems and conjecture a more general result.