Name
Abstract | ||
|---|---|---|
The number T∗(n,k) is the least positive integer such that every graph with n = (2k+1) + t vertices (t ≥ 0) and at least T∗(n,k) edges contains k mutually vertex-disjoint complete subgraphs S1, S2,…, Sk where Si has i vertices, 1 ≤ i ≤ k. Obviously T∗(n, k) ≥ T(n, k), the Turán number of edges for a Kk. It is shown that if n ≥ 98k2 then equality holds and that there is ϵ > 0 such that for (2k+1) ≤ n ≤ (2k+1) + ϵk2 inequality holds. Further T∗(n, k) is evaluated when k > k0(t). |
Year | DOI | Venue |
|---|---|---|
1977 | 10.1016/0095-8956(77)90038-7 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
extremal graph theory | Integer,Graph,Discrete mathematics,Combinatorics,Turán number,Vertex (geometry),Extremal graph theory,Mathematics | Journal |
Volume | Issue | ISSN |
23 | 2-3 | 0095-8956 |
Citations | PageRank | References |
1 | 0.37 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| D.T. Busolini | 1 | 4 | 1.91 |
| P Erdös | 2 | 626 | 190.85 |