Combinatorics and Discrete Probability Seminar
Emily Heath
Cal Poly Pomona
Proper rainbow saturation numbers
Abstract: Given a graph $H$, we say that a graph $G$ is properly rainbow $H$-saturated if there exists some proper edge-coloring of $G$ which has no rainbow copy of $H$, but adding any edge to $G$ makes such an edge-coloring impossible. The proper rainbow saturation number is the minimum number of edges in an $n$-vertex properly rainbow $H$-saturated graph. In this talk, we will discuss new bounds on the proper rainbow saturation number for odd cycles, paths, and cliques.
Monday April 28, 2025 at 3:00 PM in 1227 SEO