Geodesic
Induced complete \(h\)-partite graphs in dense clique-less graphs
The electronic journal of combinatorics, Tome 6 (1999)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

It is proven that for every fixed $h$, $a$ and $b$, a graph with $n$ vertices and minimum degree at least ${h-1 \over h}n$, which contains no copy of $K_b$ (the complete graph with $b$ vertices), contains at least $(1-o(1)){n \over ha}$ vertex disjoint induced copies of the complete $h$-partite graph with $a$ vertices in each color class.
DOI : 10.37236/1475
Classification : 05C70, 05C55
Mots-clés : clique, Ramsey, complete bipartite 
@article{10_37236_1475,
     author = {Eldar Fischer},
     title = {Induced complete \(h\)-partite graphs in dense clique-less graphs},
     journal = {The electronic journal of combinatorics},
     year = {1999},
     volume = {6},
     doi = {10.37236/1475},
     zbl = {0934.05104},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1475/}
}
TY  - JOUR
AU  - Eldar Fischer
TI  - Induced complete \(h\)-partite graphs in dense clique-less graphs
JO  - The electronic journal of combinatorics
PY  - 1999
VL  - 6
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1475/
DO  - 10.37236/1475
ID  - 10_37236_1475
ER  - 
%0 Journal Article
%A Eldar Fischer
%T Induced complete \(h\)-partite graphs in dense clique-less graphs
%J The electronic journal of combinatorics
%D 1999
%V 6
%U http://geodesic.mathdoc.fr/articles/10.37236/1475/
%R 10.37236/1475
%F 10_37236_1475
Eldar Fischer. Induced complete \(h\)-partite graphs in dense clique-less graphs. The electronic journal of combinatorics, Tome 6 (1999). doi: 10.37236/1475

Cité par Sources :