Improved algorithms for colorings of simple hypergraphs and applications

Jakub Kozik, Dmitry Shabanov

The paper deals with extremal problems concerning colorings of hypergraphs. By using a random recoloring algorithm we show that any $n$-uniform simple (i.e. every two distinct edge…