On zero‐trees

Z. Füredi, D. J. Kleitman

Research output: Article

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

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint Dive into the research topics of 'On zero‐trees'. Together they form a unique fingerprint.

  • Cite this