On rainbow saturated graphs with minimum number of edges

Yanzhe Qiu, Mei Lu, Yilin Pan +1

Let $F$ be a fixed graph without isolated vertices. An edge-colored graph is $F$-rainbow saturated if it contains no rainbow copy of $F$, but the addition of any missing edge in an…