On three measures of non-convexity release_ypmp26tcnraqhefximqzusa56u

by Josef Cibulka, Miroslav Korbelář, Jan Kynčl, Viola Mészáros, Rudolf Stolař, Pavel Valtr

Released as a article .

2015  

Abstract

The invisibility graph I(X) of a set X ⊆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)) >(n) but ω(I(X))=3. We also find sets X in R^5 with χ(X)=2, but γ(X) arbitrarily large.
In text/plain format

Archived Files and Locations

application/pdf  554.9 kB
file_ww2oecceszghdfcwhtieayd4xa
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   accepted
Date   2015-11-21
Version   v2
Language   en ?
arXiv  1410.0407v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 14ac30f1-7830-477e-8768-e0667822f3e0
API URL: JSON