For every h >= 4 there exists a (2h-1)-uniform hypergraph with no polychromatic 3-coloring whose h-heavy restricted subhypergraphs are all 2-colorable, obtained as the complement of a suitable h-uniform hypergraph on 3h-1 vertices.
Berge, Balanced matrices, Mathematical Programming 2, 19–31, 1972
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Note on polychromatic coloring of hereditary hypergraph families II
For every h >= 4 there exists a (2h-1)-uniform hypergraph with no polychromatic 3-coloring whose h-heavy restricted subhypergraphs are all 2-colorable, obtained as the complement of a suitable h-uniform hypergraph on 3h-1 vertices.