Colouring the Triangles Determined by a Point Set
classification
🧮 math.CO
cs.CG
keywords
chromaticnumberdeterminedpositiontrianglesanswerarbitrarycolouring
read the original abstract
Let P be a set of n points in general position in the plane. We study the chromatic number of the intersection graph of the open triangles determined by P. It is known that this chromatic number is at least n^3/27+O(n^2), and if P is in convex position, the answer is n^3/24+O(n^2). We prove that for arbitrary P, the chromatic number is at most n^3/19.259+O(n^2).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.