Polychromatic colorings of hypergraphs with high balance
Let $m$ be a positive integer and $C = \{1,2,\dots,m\}$ be a set of $m$ colors. A polychromatic $m$-coloring of a hypergraph is a coloring of its vertices in such a way that every hyperedge contains at least one vertex of each color in $C$. This problem is a generalization of $2$-colorings of hyperg...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2020-04-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/10.3934/math.2020195/fulltext.html |