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

A. Schrijver; P. D. Seymour

doi:10.1016/0097-3165(91)90063-M

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

A. Schrijver, P. D. Seymour

Research output: Contribution to journal › Article › peer-review

27 Scopus citations

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	https://doi.org/10.1016/0097-3165(91)90063-M
State	Published - Nov 1991
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/0097-3165(91)90063-M

Cite this

@article{23c4ea0287064af291bfb11a0e7885d9,

title = "A simpler proof and a generalization of the zero-trees theorem",

abstract = "Z. F{\"u}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.",

author = "A. Schrijver and Seymour, {P. D.}",

year = "1991",

month = nov,

doi = "10.1016/0097-3165(91)90063-M",

language = "English (US)",

volume = "58",

pages = "301--305",

journal = "Journal of Combinatorial Theory, Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

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

AU - Schrijver, A.

AU - Seymour, P. D.

PY - 1991/11

Y1 - 1991/11

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=44949270226&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=44949270226&partnerID=8YFLogxK

U2 - 10.1016/0097-3165(91)90063-M

DO - 10.1016/0097-3165(91)90063-M

M3 - Article

AN - SCOPUS:44949270226

SN - 0097-3165

VL - 58

SP - 301

EP - 305

JO - Journal of Combinatorial Theory, Series A

JF - Journal of Combinatorial Theory, Series A

IS - 2

ER -

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

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this