DMS Graduate Student Seminar

Speaker: John Carr

Title: Color Trades


Abstract: Trade spectra of graphs have applications to intersection problems and defining sets of graph-designs. The color trade spectrum of a simple graph G is defined to be the set of all t for which there exist two proper edge-colorings of G using t colors such that each vertex of G is incident to the same set of colors under each coloring while each edge receives a different color under each coloring. In this talk, I give some constructions which are used to determine the color trade spectrum of several families of graphs.