DMS Combinatorics Seminar

Speaker: Neal Bushaw (Virginia Commonwealth University)

Title: Rainbow Saturated Graphs

Abstract: An edge colored graph is called RAINBOW if all its edges are colored differently.  What can we say about the set of graphs which avoid some particular rainbow subgraph?  This question has sporadic roots dating back many years, but saw attention when the rainbow Turán numbers were first systematically studied by Keevash, Mubayi, Sudakov, and Verstraete in 2007.  In this talk I'll give a very general definition of partial rainbow saturation that allows us to survey a wide range of extremal results and put them into a historical context, with a focus on new and open problems.  This talk requires no specific background beyond (very) basic graph theory.