|
|
|
|
|
A coloring of a set $X$ by $Y$ is just a function $f:X\rightarrow Y$ The term coloring is used because the function can be thought of as assigning a ``color'' from $Y$ to each element of $X$
Any coloring provides a partition of $X$ for each $y\in Y$ $f^{-1}(y)$ the set of elements $x$ such that $f(x)=y$ is one element of the partition. Since $f$ is a function, the sets in the partition are disjoint, and since it is a total function, their union is $X$
|
"coloring" is owned by Henry.
|
|
(view preamble | get metadata)
Cross-references: union, total function, disjoint, partition, term, function
There are 21 references to this entry.
This is version 2 of coloring, born on 2002-08-10, modified 2005-03-03.
Object id is 3283, canonical name is Coloring.
Accessed 6483 times total.
Classification:
| AMS MSC: | 05D10 (Combinatorics :: Extremal combinatorics :: Ramsey theory) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|