ACO The ACO Seminar (2011-2012)

Nov 17, 3:30pm, Wean 8220
Andrzej Dudek, Western Michigan University
On rainbow Hamilton cycles in uniform hypergraphs


It is well known that if the edges of the complete graph K_n are colored so that no color appears more than cn times (c is an absolute constant), then there is a Hamilton cycle in which each edge is a different color. In this talk, we generalize this result for uniform hypergraphs.

Joint work with A. Frieze and A. Rucinski.

Back to the ACO home page