1 paper
Balázs Bursics, Bence Csonka, Luca Szepessy
In this paper we study the minimal size of edges in hypergraph families that guarantees the existence of a polychromatic coloring, that is, a k-coloring of a vertex set such that…