On zero‐trees

Z. Füredi, D. J. Kleitman

Research output: Contribution to journalArticle

23 Citations (Scopus)

Abstract

Consider an integer‐valued function on the edge‐set of the complete graph Km+1. The weight of an edge‐subset is defined to be the sum of the associated weights. It is proved that there exists a spanning tree with weight 0 modulo m.

Original languageEnglish
Pages (from-to)107-120
Number of pages14
JournalJournal of Graph Theory
Volume16
Issue number2
DOIs
Publication statusPublished - 1992

Fingerprint

Spanning tree
Complete Graph
Modulo

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

On zero‐trees. / Füredi, Z.; Kleitman, D. J.

In: Journal of Graph Theory, Vol. 16, No. 2, 1992, p. 107-120.

Research output: Contribution to journalArticle

Füredi, Z. ; Kleitman, D. J. / On zero‐trees. In: Journal of Graph Theory. 1992 ; Vol. 16, No. 2. pp. 107-120.
@article{7222e4b41b9c4e12b69e49af5009e118,
title = "On zero‐trees",
abstract = "Consider an integer‐valued function on the edge‐set of the complete graph Km+1. The weight of an edge‐subset is defined to be the sum of the associated weights. It is proved that there exists a spanning tree with weight 0 modulo m.",
author = "Z. F{\"u}redi and Kleitman, {D. J.}",
year = "1992",
doi = "10.1002/jgt.3190160202",
language = "English",
volume = "16",
pages = "107--120",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "2",

}

TY - JOUR

T1 - On zero‐trees

AU - Füredi, Z.

AU - Kleitman, D. J.

PY - 1992

Y1 - 1992

N2 - Consider an integer‐valued function on the edge‐set of the complete graph Km+1. The weight of an edge‐subset is defined to be the sum of the associated weights. It is proved that there exists a spanning tree with weight 0 modulo m.

AB - Consider an integer‐valued function on the edge‐set of the complete graph Km+1. The weight of an edge‐subset is defined to be the sum of the associated weights. It is proved that there exists a spanning tree with weight 0 modulo m.

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

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

U2 - 10.1002/jgt.3190160202

DO - 10.1002/jgt.3190160202

M3 - Article

AN - SCOPUS:84987550745

VL - 16

SP - 107

EP - 120

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 2

ER -