Conflict-Free Colouring of Subsets

by   Bruno Jartoux, et al.

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 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 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∪ d_2)∩ P|≥ 2 there is a uniquely (in d_1 ∪ 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.


page 1

page 3

page 5

page 9

page 11

page 13


Conflict-free connections: algorithm and complexity

A path in an(a) edge(vertex)-colored graph is called a conflict-free pat...

On conflict-free chromatic guarding of simple polygons

We study the problem of colouring the vertices of a polygon, such that e...

Conflict-free connection of trees

An edge-colored graph G is conflict-free connected if, between each pair...

Complex Number Formulation and Convex Relaxations for Aircraft Conflict Resolution

We present a novel complex number formulation along with tight convex re...

Pliable Index Coding via Conflict-Free Colorings of Hypergraphs

In the pliable index coding (PICOD) problem, a server is to serve multip...

Initial Conflicts for Transformation Rules with Nested Application Conditions

We extend the theory of initial conflicts in the framework of M-adhesive...

On Classes of Functions for which No Free Lunch Results Hold

In a recent paper it was shown that No Free Lunch results hold for any s...

Please sign up or login with your details

Forgot password? Click here to reset