Extremal graphs for blow-ups of cycles and trees
The electronic journal of combinatorics, Tome 20 (2013) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

The blow-up of a graph H is the graph obtained from replacing each edge in H by a clique of the same size where the new vertices of the cliques are all different. Erdős et al. and Chen et al. determined the extremal number of blow-ups of stars. Glebov determined the extremal number and found all extremal graphs for blow-ups of paths. We determined the extremal number and found the extremal graphs for the blow-ups of cycles and a large class of trees, when n is sufficiently large. This generalizes their results. The additional aim of our note is to draw attention to a powerful tool, a classical decomposition theorem of Simonovits.
DOI : 10.37236/2856
Classification : 05C35, 05C38, 05C05, 05C70
Mots-clés : extremal graphs

Hong Liu  1

1 University of Illinois at Urbana-Champaign
@article{10_37236_2856,
     author = {Hong Liu},
     title = {Extremal graphs for blow-ups of cycles and trees},
     journal = {The electronic journal of combinatorics},
     year = {2013},
     volume = {20},
     number = {1},
     doi = {10.37236/2856},
     zbl = {1266.05074},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2856/}
}
TY  - JOUR
AU  - Hong Liu
TI  - Extremal graphs for blow-ups of cycles and trees
JO  - The electronic journal of combinatorics
PY  - 2013
VL  - 20
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2856/
DO  - 10.37236/2856
ID  - 10_37236_2856
ER  - 
%0 Journal Article
%A Hong Liu
%T Extremal graphs for blow-ups of cycles and trees
%J The electronic journal of combinatorics
%D 2013
%V 20
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/2856/
%R 10.37236/2856
%F 10_37236_2856
Hong Liu. Extremal graphs for blow-ups of cycles and trees. The electronic journal of combinatorics, Tome 20 (2013) no. 1. doi: 10.37236/2856

Cité par Sources :