The rainbow saturation number

Add to your list(s) Download to your calendar using vCal

• Speaker to be confirmed
• Thursday 15 May 2025, 14:30-15:30
• MR12.

If you have a question about this talk, please contact ibl10.

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 of any non-edge in any colour creates a rainbow copy of F. The rainbow saturation number of F is the minimum number of edges in an F-rainbow saturated graph on n vertices. Girão, Lewis, and Popielarz conjectured that, like the saturation number, for all F the rainbow saturation number is linear in n. I will present our attractive and elementary proof of this conjecture, and finish with a discussion of related results and open questions.

This is joint work with Tom Johnston, Shoham Letzter, Natasha Morrison and Shannon Ogden.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.