| Monday | Tuesday | Wednesday | Thursday | Friday |
|---|
| Seminars | Announcements | Conferences | Calendar Archive |
Items for inclusion in the Weekly Calendar should be submitted via e-mail to Hilda Britt. Deadline for inclusion in the Weekly Calendar is 5 p.m. Thursdays. Speakers are encouraged to provide abstracts.
Let G = (V,E) be a graph with the sets of lists S(v),
one for each vertex v of G, and let d be an integer such that
1. for every vertex |S(v)| = (1+o(1))d, and
2. for each c Î S(v), at most d neighbors of v have c in
their lists.
Then there exist a proper coloring of G from these lists.
This result, which is asymptotically tight, is joint work with Bruce Reed.
Last modified September 4, 2001