| Full text | |
| Author(s): |
Total Authors: 4
|
| Affiliation: | [1] London Sch Econ, Dept Math, London WC2A 2AE - England
[2] Czech Acad Sci Czech Republ, Inst Math, Prague - Czech Republic
[3] Univ W Bohemia, New Technol Informat Soc, Plzen - Czech Republic
Total Affiliations: 3
|
| Document type: | Journal article |
| Source: | CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES; v. 67, n. 4, p. 721-758, AUG 2015. |
| Web of Science Citations: | 4 |
| Abstract | |
We find, for all sufficiently large n and each k, the maximum number of edges in an n-vertex graph that does not contain k + 1 vertex-disjoint triangles. This extends a result of Moon {[}Canad. J. Math. 20 (1968), 96-102], which is in turn an extension of Mantel's Theorem. Our result can also be viewed as a density version of the Corradi-Hajnal Theorem. (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 |