Prof. Neal Bushaw
Forbidding Rainbow Subgraphs

Abstract: A subgraph H in an edge-colored graph is called rainbow if H has no repeated edge color. With several current VCU SYSM students, we study the properties of large graphs which can be properly edge-colored in a way which avoids rainbow copies of some fixed graph H. Which of these rainbow-H-free graphs is the largest? Among those which are maximal, which graphs are the smallest? I'll give a gentle introduction to this area and our ongoing research, as well as some of the many connections to both traditional extremal graph theory and chromatic theory.