Premium
On zero‐trees
Author(s) -
Füredi Zoltán,
Kleitman D. J.
Publication year - 1992
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190160202
Subject(s) - mathematics , modulo , combinatorics , integer (computer science) , graph , spanning tree , enhanced data rates for gsm evolution , zero (linguistics) , discrete mathematics , weight function , tree (set theory) , telecommunications , linguistics , philosophy , statistics , computer science , programming language
Consider an integer‐valued function on the edge‐set of the complete graph K m+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 .
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom