Name
Abstract | ||
|---|---|---|
The paper deals with common generalizations of classical results of Ramsey and Turán. The following is one of the main results.
Assumek≧2, ε>0,G
n
is a sequence of graphs ofn-vertices and at least 1/2((3k−5) / (3k−2)+ε)n
2 edges, and the size of the largest independent set inG
n
iso(n). LetH be any graph of arboricity at mostk. Then there exists ann
0 such that allG
n
withn>n
0 contain a copy ofH. This result is best possible in caseH=K
2k
. |
Year | DOI | Venue |
|---|---|---|
1983 | 10.1007/BF02579342 | Combinatorica |
Keywords | DocType | Volume |
05 C 55, 05 C 35 | Journal | 3 |
Issue | ISSN | Citations |
1 | 1439-6912 | 16 |
PageRank | References | Authors |
5.17 | 1 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul Erdös | 1 | 111 | 23.10 |
| András Hajnal | 2 | 208 | 24.43 |
| Vera T. Sós | 3 | 318 | 62.21 |
| Endre Szemerédi | 4 | 2102 | 363.27 |