Given a set S, and a set T of subsets of S, a coloring of the elements of S is called T-polychromatic if every set in T contains an element of every color. Let polyT(S) be the largest n for which there is a T-polychromatic coloring of S with n colors. This talk introduces theorems and open problems on the value of polyT(S) in three settings:
Before the talk, at 3:10pm, there will be tea and cookies in Wean 6220.
Back to the ACO home page