Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 7 Dec 2018 in cs.DM and math.CO

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

Summary

We haven't generated a summary for this paper yet.