𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On zero-trees

✍ Scribed by Zoltán Füredi; D. J. Kleitman

Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
544 KB
Volume
16
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

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.

📜 SIMILAR VOLUMES

On q-trees
On q-trees
✍ Chong-Yun Chao; Nian-Zu Li; Shao-Ji Xu 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB

We show that a graph G with n vertices is a q-tree if and only if its chromatic polynomial is P(G,A) = A(A -I)...(A -q + l ) ( As ) " -~ where n L q. The graphs which we consider here are finite, undirected, simple, and loopless. Let q be an integer L 1. The graphs called q-trees are defined by re

On Exponential Trees
On Exponential Trees
✍ D. Fon–Der–Flaass 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 82 KB

We give a necessary and sufficient condition for a tree from a certain class to have exponential growth rate (in the sense of [1]). The class contains, in particular, all trees of bounded valency; and also includes the class of trees without end-vertices which was considered in [1].

cover
One/Zero
✍ Kathleen Ann Goonan 📂 Fiction 🏛 Tom Doherty Associates 🌐 en-US ⚖ 69 KB
cover
One Tree
✍ Stephen R. Donaldson 📂 Fiction 📅 1982;2012 🏛 Del Rey;Random House Publishing Group 🌐 en-US ⚖ 318 KB 👁 4 views

Thomas Covenant and Linden Avery begin their search for the One Tree that is to be the salvation of the Land. Only he could find the answer and forge a new Staff of Law--but fate decreed that the journey was to be long, the quest arduous, and quite possibly a failure.... Advertising Library

On Reconstructing Rooted Trees
On Reconstructing Rooted Trees
✍ T. Andreae 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 667 KB

A probably very difficult question of Nash-Williams asks whether any two hypomorphic trees are isomorphic. In the present paper, we consider rooted trees rather than trees and give an affirmative answer to the corresponding version of Nash-Williams' question, i.e., we show that any two hypomorphic r