Z. Füredi 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.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics