Events
DMS Graduate Student Seminar |
| Time: Jan 23, 2019 (03:00 PM) |
| Location: Parker Hall 249 |
|
Details: Speaker: Andrew Owens (PhD student in our department working under the supervision of Dr. Peter Johnson) Title: Rainbow Cycle Forbidding Edge Colorings Abstract: It is well known that a complete graph on \(n\) vertices can be edge colored with \(n-1\) colors in order to avoid rainbow cycles. No such coloring exists using \(n\) colors. A certain encoding of full binary trees produces edge colorings using this maximum number of colors, \(n-1\), in order to avoid rainbow cycles. Interestingly, all such colorings can be formed using this encoding. A few years later a similar result was found to hold for complete bipartite graphs and, subsequently, complete multipartite graphs. Most recently, an analogous theorem was found for all general connected graphs. First, we will look at the connection between these edge colorings and full binary trees; we then will highlight some of the important ideas used in order to prove the general case. |