Turán-Ramsey problems
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 U ⋯ U Gk? We shall answer this Turán-Ramsey-type question asymptotically, and pose a number of related problems.
Publication Title
Discrete Mathematics
Recommended Citation
Bollobás, B. (1996). Turán-Ramsey problems. Discrete Mathematics, 156 (1-3), 257-262. https://doi.org/10.1016/0012-365X(96)00024-6
COinS
