Transversals via regularity

Yangyang Cheng, Katherine Staden

Given graphs $G_1,\dots ,G_s$ all on the same vertex set and a graph $H$ with $e(H)\le s$, a copy of $H$ is transversal or rainbow if it contains at most one edge from each $G_c$…