Collins Conference Room
Seminar
US Mountain Time
Speaker:
Puck Rombach (University of Vermont)
Our campus is closed to the public for this event.
Abstract. The guessing number problem is the following. What is the largest family of colorings of a graph such that the color of each vertex is determined by its neighborhood? This problem is equivalent to finding protocols for network coding. I will discuss results on general graphs, and recent asymptotic results for odd cycles, which is joint work with Ross Atkins and Fiona Skerman.