RJ Stading : Coloring the Cube with Rainbow Cycles

Posted by Phillip Wesolek , part of the Graduate Student Colloquium.

At

Sept. 23, 2013, 5:30 p.m.

In

SEO 636

Abstract

Given graphs $G$ and $H$ and a number $m$, let $f(G,H,m)$ be the number of colors required to edge color $G$ so that every copy of $H$ in $G$ contains at least $m$ distinct colors amongst its edges. Let $Q_n$ denote the the $n$-dimensional hypercube and $C_k$ denote the cycle of length $k$. For even values of $k$, we will look at $f(Q_n,C_k,k)$.