Coloring Delaunay-edges and their generalizations (Q1984605)

In this paper, the authors consider geometric hypergraphs in which the set of vertices is a finite set of points. The hyperedges of such hypergraphs are the intersections of this set with some family of (geometric) regions. The starting point for the authors is the following problem: given an integer \(k\), when does there exist a positive integer \(N=N_k\) depending on \(k\), such that all set of points can be \(k\)-colored in a way that every hyperedge of cardinality at least \(N\) contains points of different (or all \(k\)) colors. In the paper, the authors consider a generalization of this problem, where they introduce a coloring of \(t\)-subsets of points. Then they present results for geometric hypergraphs that arise from halfplanes, pseudodisks, axis-parallel and bottomless rectangles, etc..