Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Szepessy, Luca"'
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 every hyperedge contains a vertex of all $k$ color classes. We also i
Externí odkaz:
http://arxiv.org/abs/2307.12154
