👉 In logic, a non-colorable relation or function is one that cannot be colored by a set of colors. That is, a relation or function is noncolorable if it can never be represented as a finite sequence of colors. This property refers to the fact that any set of colors must contain at least one color that does not appear in this representation.
