arXiv · 1410.0407
On three measures of non-convexity
Abstract
The invisibility graph $I(X)$ of a set $X \subseteq \mathbb{R}^d$ is a (possibly infinite) graph whose vertices are the points of $X$ and two vertices are connected by an edge if and only if the straight-line segment connecting the two corresponding points is not fully contained in $X$. We consider the following three parameters of a set $X$: the clique number $ω(I(X))$, the chromatic number $χ(I(X))$ and the convexity number $γ(X)$, which is the minimum number of convex subsets of $X$ that cover $X$. We settle a conjecture of Matoušek and Valtr claiming that for every planar set $X$, $γ(X)$ can be bounded in terms of $χ(I(X))$. As a part of the proof we show that a disc with $n$ one-point holes near its boundary has $χ(I(X)) \ge \log\log(n)$ but $ω(I(X))=3$. We also find sets $X$ in $\mathbb{R}^5$ with $χ(X)=2$, but $γ(X)$ arbitrarily large.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Josef Cibulka, Miroslav Korbelář, Jan Kynčl, Viola Mészáros, Rudolf Stolař, Pavel Valtr. 2015-11-21. On three measures of non-convexity. https://doi.org/10.1007/s11856-017-1467-1
Cite the original work for its findings. Save a collection to share your selection of sources.