A hypergraph exists that is colorable by each of given palettes but not by an additional palette exactly when no palette homomorphism exists to that additional palette or its inverse.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Uniform Tur\'an density -- palette classification
A hypergraph exists that is colorable by each of given palettes but not by an additional palette exactly when no palette homomorphism exists to that additional palette or its inverse.