| Full text | |
| Author(s): |
Total Authors: 4
|
| Affiliation: | [1] London Sch Econ, Dept Math, London WC2A 2AE - England
[2] Acad Sci Czech Republic, Math Inst, Prague - Czech Republic
[3] Univ W Bohemia, European Ctr Excellence NTIS, Plzen 30614 - Czech Republic
Total Affiliations: 3
|
| Document type: | Journal article |
| Source: | ELECTRONIC JOURNAL OF COMBINATORICS; v. 21, n. 4 OCT 2 2014. |
| Web of Science Citations: | 1 |
| Abstract | |
We determine the maximum number of edges of an n-vertex graph G with h the property that none of its e-cliques intersects a fixed set M subset of V(G). For (r-1)vertical bar M vertical bar >= n, the (r-1)-partite Turn graph turns out to be the unique extremal graph. For (r-1)vertical bar M vertical bar < n, there is a whole family of extremal graphs, which we describe explicitly. In addition we provide corresponding stability results. (AU) | |
| FAPESP's process: | 09/17831-7 - Embedding and packing problems in extremal graph theory |
| Grantee: | Julia Boettcher |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 10/09555-7 - Embedding, randomised and structural problems in extremal graph theory |
| Grantee: | Peter David Allen |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |