Open Collections

Disjointness Graphs

Banff International Research Station for Mathematical Innovation and Discovery

The {\em disjointness graph} $G=G({\cal S})$ of a set of segments ${\cal S}$ in ${R}^d$, $d\ge 2,$ is a graph whose vertex set is ${\cal S}$ and two vertices are connected by an edge if and only if the corresponding segments are disjoint. We prove that the chromatic number of $G$ is bounded by a function of $\omega(G)$, the clique number of $G$. More precisely, we have $\chi(G)\le(\omega(G))^4+(\omega(G))^3$. It follows, that $\cal S$ has $\Omega(n^{1/5})$ pairwise intersecting or pairwise disjoint elements. Stronger bounds are established for lines in space, instead of segments. We show that computing $\omega(G)$ and $\chi(G)$ for disjointness graphs of lines in space are NP-complete tasks. However, we can design efficient algorithms to compute proper colorings of $G$ in which the number of colors satisfies the above upper bounds. One cannot expect similar results for sets of continuous arcs, instead of segments, even in the plane. We construct families of arcs whose disjointness graphs are triangle-free ($\omega(G)=2$), but whose chromatic numbers are arbitrarily large. Joint work with G\'abor Tardos and G\'eza T\'oth.

Mathematics; Convex and discrete geometry; Geometry; Discrete mathematics

video/mp4

Author affiliation: Ecole Polytechnique Federale de Lausanne

2017-12-04

Attribution-NonCommercial-NoDerivatives 4.0 International

http://hdl.handle.net/2429/63800

Unreviewed

http://creativecommons.org/licenses/by-nc-nd/4.0/