Conflict-free coloring with respect to a subset of intervals

Panagiotis Cheilaris, Shakhar Smorodinsky

Given a hypergraph H = (V, E), a coloring of its vertices is said to be conflict-free if for every hyperedge S \in E there is at least one vertex in S whose color is distinct from…