A Note on Weighted Rooted Trees
Combinatorics
2015-07-08 v3
Abstract
Let be a tree rooted at . Two vertices of are related if one is a descendant of the other; otherwise, they are unrelated. Two subsets and of are unrelated if, for any and , and are unrelated. Let be a nonnegative weight function defined on with . In this note, we prove that either there is an -path with for some , or there exist unrelated sets such that and . The bound is tight. This answers a question posed in a very recent paper of Bonamy, Bousquet and Thomass\'e.
Keywords
Cite
@article{arxiv.1504.04392,
title = {A Note on Weighted Rooted Trees},
author = {Zi-Xia Song and Talon Ward and Alexander York},
journal= {arXiv preprint arXiv:1504.04392},
year = {2015}
}