an:06122720
Zbl 1375.68131
Fabila-Monroy, Ruy; Wood, David R.
The chromatic number of the convex segment disjointness graph
EN
Márquez, Alberto (ed.) et al., Computational geometry. XIV Spanish meeting on computational geometry, EGC 2011, dedicated to Ferran Hurtado on the occasion of his 60th birthday, Alcalá de Henares, Spain, June 27--30, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-34190-8/pbk). Lecture Notes in Computer Science 7579, 79-84 (2012).
2012
a
68U05 05C15 68R10
Summary: Let \(P\) be a set of \(n\) points in general and convex position in the plane. Let \(D_{n}\) be the graph whose vertex set is the set of all line segments with endpoints in \(P\), where disjoint segments are adjacent. The chromatic number of this graph was first studied by \textit{G. Araujo} et al. [Comput. Geom. 32, No. 1, 59--69 (2005; Zbl 1067.05023)]. The previous best bounds are \(\frac{3n}{4}\leq \chi(D_n) <n-\sqrt{\frac{n}{2}}\) (ignoring lower order terms). In this paper we improve the lower bound to \(\chi(D_n)\geq n-\sqrt{2n}\), achieving near-tight bounds on \(\chi (D_{n})\).
For the entire collection see [Zbl 1253.68016].
1067.05023