3 research outputs found
The Maximum Chromatic Number of the Disjointness Graph of Segments on -point Sets in the Plane with
Let be a finite set of points in general position in the plane. The
disjointness graph of segments of is the graph whose vertices are
all the closed straight line segments with endpoints in , two of which are
adjacent in if and only if they are disjoint. As usual, we use
to denote the chromatic number of , and use to denote
the maximum taken over all sets of points in general
position in the plane. In this paper we show that if and only if
.Comment: 25 pages, 3 figure