Conflict-free colorings of graphs and hypergraphs

  title={Conflict-free colorings of graphs and hypergraphs},
  author={J{\'a}nos Pach and G{\'a}bor Tardos and Simon Fraser},
A coloring of the vertices of a hypergraph H is called conflict-free if each hyperedge E of H contains a vertex of “unique” color that does not get repeated in E. The smallest number of colors required for such a coloring is called the conflict-free chromatic number of H, and is denoted by χCF(H). This parameter was first introduced by Even et al. (FOCS… CONTINUE READING