A simpler proof and a generalization of the zero-trees theorem

Abstract Z. Furedi and D. J. Kleitman proved that if an integer weight is assigned to each edge of a complete graph on p + 1 vertices, then some spanning tree has total weight divisible by p . We obtain a simpler proof by generalizing the result to hypergraphs.