Combinatorics and Discrete Probability Seminar: Proper rainbow saturation numbers, by Emily Heath
April 28, 2025
3:00 PM - 3:50 PM
Emily Heath (Cal Poly Pomona): Proper rainbow saturation numbers
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.
Please click here to make changes to, or delete, this seminar announcement.
Date posted
Apr 23, 2025
Date updated
Apr 23, 2025
Speakers
