Title of article
Turán-Ramsey problems
Author/Authors
Béla Bollob?s، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
6
From page
257
To page
262
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.
Journal title
Discrete Mathematics
Serial Year
1996
Journal title
Discrete Mathematics
Record number
943908
Link To Document