1 paper
Margarita Akhmejanova, József Balogh
We deal with an extremal problem concerning panchromatic colorings of hypergraphs. A vertex r-coloring of a hypergraph H is \emph{panchromatic} if every edge meets every color.…