A note on rainbow saturation number of paths

Shujuan Cao, Yuede Ma, Zhenyu Taoqiu

For a fixed graph $F$ and an integer $t$, the \dfn{rainbow saturation number} of $F$, denoted by $sa{t}_t(n,\mathfrak{R}(F))$, is defined as the minimum number of edges in a $t$-edge…