English

Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets

Discrete Mathematics 2018-12-10 v1 Combinatorics

Abstract

Let RR and BB be a set of red points and a set of blue points in the plane, respectively, such that RBR\cup B is in general position, and let f:R{2,3,4,}f:R \to \{2,3,4, \ldots \} be a function. We show that if 2BxR(f(x)2)+22\le |B|\le \sum_{x\in R}(f(x)-2) + 2, then there exists a non-crossing geometric spanning tree TT on RBR\cup B such that 2degT(x)f(x)2\le \operatorname{deg}_T(x)\le f(x) for every xRx\in R and the set of leaves of TT is BB, where every edge of TT is a straight-line segment.

Keywords

Cite

@article{arxiv.1812.02866,
  title  = {Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets},
  author = {Mikio Kano and Kenta Noguchi and David Orden},
  journal= {arXiv preprint arXiv:1812.02866},
  year   = {2018}
}

Comments

6 pages, 2 figures