Conflict-Free Colouring of Subsets

Abstract

We introduce and study conflict-free colourings of $t$-subsets in hypergraphs. In such colourings, one assigns colours to all subsets of vertices of cardinality $t$ such that in any hyperedge of cardinality at least $t$ there is a uniquely coloured $t$-subset. The case $t=1$, i.e., vertex conflict-free colouring, is a well-studied notion. Already the case $t=2$ (i.e., colouring pairs) seems to present a new challenge. Many of the tools used for conflict-free colouring of geometric hypergraphs rely on hereditary properties of the underlying hypergraphs. When dealing with subsets of vertices, the properties do not pass to subfamilies of subsets. Therefore, we develop new tools, which might be of independent interest. (i) For any fixed $t$, we show that the $\binom n t$ $t$-subsets in any set $P$ of $n$ points in the plane can be coloured with $O(t^2 \log^2 n)$ colours so that any axis-parallel rectangle that contains at least $t$ points of $P$ also contains a uniquely coloured $t$-subset. (ii) For a wide class of "well behaved" geometrically defined hypergraphs, we provide near tight upper bounds on their $t$-subset conflict-free chromatic number. For $t=2$ we show that for each of those "well -behaved" hypergraphs $H$, the hypergraph $H'$ obtained by taking union of two hyperedges from $H$, admits a $2$-subset conflict-free colouring with roughly the same number of colours as $H$. For example, we show that the $\binom n 2$ pairs of points in any set $P$ of $n$ points in the plane can be coloured with $O(\log n)$ colours such that for any two discs $d_1,d_2$ in the plane with $|(d_1\cup d_2)\cap P|\geq 2$ there is a uniquely (in $d_1 \cup d_2$) coloured pair. (iii) We also show that there is no general bound on the $t$-subset conflict-free chromatic number as a function of the standard conflict-free chromatic number already for $t=2$.