Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets
Abstract
Let R and B be a set of red points and a set of blue points in the plane, respectively, such that R B is in general position, and let f:R \2,3,4, … \ be a function. We show that if 2 |B| Σx∈ R(f(x)-2) + 2, then there exists a non-crossing geometric spanning tree T on R B such that 2 degT(x) f(x) for every x∈ R and the set of leaves of T is B, where every edge of T is a straight-line segment.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.