Department of Mathematical Sciences
Events
People
Colloquia and Seminars
Conferences
Centers
Positions
Areas of Research
About the Department
Alumni |
Algorithms, Combinatorics and Optimization Seminar
Carnegie Melllon University and Westminster College Title: Polychromatic Colorings on Hypercubes, Complete Graphs, and Integers Abstract: 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:
Date: Thursday, December 8, 2016 Time: 3:30 pm Location: Wean Hall 8220 |