4 citations · 8 across the 3 of their papers we have counts for
1 paper · 1 filter
Natalie Behague, Tom Johnston, Shoham Letzter +2
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 crea…