Geodesic
A Density Corrádi–Hajnal Theorem
Canadian journal of mathematics, Tome 67 (2015) no. 4, pp. 721-758

Voir la notice de l'article provenant de la source Cambridge

DOI

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 Corrádi–Hajnal Theorem.
DOI : 10.4153/CJM-2014-030-6
Mots-clés : 05C35, graph theory, Turan's Theorem, Mantel's Theorem, Corrádi–Hajnal Theorem, triangle 
Allen, Peter; Böttcher, Julia; Hladký, Jan; Piguet, Diana. A Density Corrádi–Hajnal Theorem. Canadian journal of mathematics, Tome 67 (2015) no. 4, pp. 721-758. doi: 10.4153/CJM-2014-030-6
@article{10_4153_CJM_2014_030_6,
     author = {Allen, Peter and B\"ottcher, Julia and Hladk\'y, Jan and Piguet, Diana},
     title = {A {Density} {Corr\'adi{\textendash}Hajnal} {Theorem}},
     journal = {Canadian journal of mathematics},
     pages = {721--758},
     year = {2015},
     volume = {67},
     number = {4},
     doi = {10.4153/CJM-2014-030-6},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-2014-030-6/}
}
TY  - JOUR
AU  - Allen, Peter
AU  - Böttcher, Julia
AU  - Hladký, Jan
AU  - Piguet, Diana
TI  - A Density Corrádi–Hajnal Theorem
JO  - Canadian journal of mathematics
PY  - 2015
SP  - 721
EP  - 758
VL  - 67
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-2014-030-6/
DO  - 10.4153/CJM-2014-030-6
ID  - 10_4153_CJM_2014_030_6
ER  - 
%0 Journal Article
%A Allen, Peter
%A Böttcher, Julia
%A Hladký, Jan
%A Piguet, Diana
%T A Density Corrádi–Hajnal Theorem
%J Canadian journal of mathematics
%D 2015
%P 721-758
%V 67
%N 4
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-2014-030-6/
%R 10.4153/CJM-2014-030-6
%F 10_4153_CJM_2014_030_6

Cité par Sources :