Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The rainbow saturation number is linear (2211.08589v2)

Published 16 Nov 2022 in math.CO

Abstract: Given a graph $H$, we say that an edge-coloured graph $G$ is $H$-rainbow saturated if it does not contain a rainbow copy of $H$, but the addition of any non-edge in any colour creates a rainbow copy of $H$. The rainbow saturation number $\text{rsat}(n,H)$ is the minimum number of edges among all $H$-rainbow saturated edge-coloured graphs on $n$ vertices. We prove that for any non-empty graph $H$, the rainbow saturation number is linear in $n$, thus proving a conjecture of Gir~{a}o, Lewis, and Popielarz. In addition, we also give an improved upper bound on the rainbow saturation number of the complete graph, disproving a second conjecture of Gir~{a}o, Lewis, and Popielarz.

Citations (6)

Summary

We haven't generated a summary for this paper yet.