JaehyeonSeo

For given $k$ graphs $G_1,\dots ,G_k$ over a common vertex set of size $n$, what conditions on $G_i$ ensures a 'colorful' copy of $H$, i.e. a copy of $H$ containing at most one edge from each $G_i$? Keevash, Saks, Sudakov, and Verstraëte defined ${\mathrm{ex}}_k(n,H)$ to be the maximum total number of edges of the graphs …