Anti-Ramsey Theory for cycles in Complete Graphs
by Kyle Pula
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: email@example.com