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é.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.