School Seminars and Colloquia

Anti-Ramsey Theory for cycles in Complete Graphs

Discrete Structures and Algorithms (Seminar)

by Kyle Pula


Institution: University of Denver
Date: Tue 20th April 2010
Time: 2:15 PM
Location: Room 215, Richard Berry Building, The University of Melbourne

Abstract: This talk will survey results in anti-ramsey theory for
cycles. Specifically, we'll look at edge-colorings of complete finite graphs that lack rainbow cycles of prescribed lengths. (A subgraph is rainbow if its edge-colors are pairwise distinct.) The talk will be a
gentle survey of results in this area with no particular background required.

For More Information: contact: David Wood. email: woodd@unimelb.edu.au