BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The rainbow saturation number - Natalie Behague (Warwick)
DTSTART:20250515T133000Z
DTEND:20250515T143000Z
UID:TALK232105@talks.cam.ac.uk
CONTACT:103978
DESCRIPTION:The saturation number of a graph is a famous and well-studied 
 counterpoint to the Turán number\, and the rainbow saturation number is a
  generalisation of the saturation number to the setting of coloured graphs
 . Specifically\, for a given graph F\, an edge-coloured graph is F-rainbow
  saturated if it does not contain a rainbow copy of F\, but the addition o
 f any non-edge in any colour creates a rainbow copy of F. The rainbow satu
 ration number of F is the minimum number of edges in an F-rainbow saturate
 d graph on n vertices. Girão\, Lewis\, and Popielarz conjectured that\, l
 ike the saturation number\, for all F the rainbow saturation number is lin
 ear in n. I will present our attractive and elementary proof of this conje
 cture\, and finish with a discussion of related results and open questions
 .\n\nThis is joint work with Tom Johnston\, Shoham Letzter\, Natasha Morri
 son and Shannon Ogden.
LOCATION:MR12
END:VEVENT
END:VCALENDAR