Abstract :
For i = 1, 2, … , k, let Gi be a graph with vertex set [n] = {1,…,n} containing no Fi as a subgraph. At most how many edges are in G1 ∪ ··· ∪ Gk? We shall answer this Turán-Ramsey-type question asymptotically, and pose a number of related problems.
