### Abstract

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.

Original language | English (US) |
---|---|

Pages (from-to) | 301-305 |

Number of pages | 5 |

Journal | Journal of Combinatorial Theory, Series A |

Volume | 58 |

Issue number | 2 |

DOIs | |

State | Published - Nov 1991 |

Externally published | Yes |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics

## Fingerprint Dive into the research topics of 'A simpler proof and a generalization of the zero-trees theorem'. Together they form a unique fingerprint.

## Cite this

Schrijver, A., & Seymour, P. D. (1991). A simpler proof and a generalization of the zero-trees theorem.

*Journal of Combinatorial Theory, Series A*,*58*(2), 301-305. https://doi.org/10.1016/0097-3165(91)90063-M