Geodesic
Cliques in graphs excluding a complete graph minor
David R. Wood1
1Monash University
The electronic journal of combinatorics, Tome 23 (2016) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

This paper considers the following question: What is the maximum number of $k$-cliques in an $n$-vertex graph with no $K_t$-minor? This question generalises the extremal function for $K_t$-minors, which corresponds to the $k=2$ case. The exact answer is given for $t\leq 9$ and all values of $k$. We also determine the maximum total number of cliques in an $n$-vertex graph with no $K_t$-minor for $t\leq 9$. Several observations are made about the case of general $t$.
DOI : 10.37236/5715
Classification : 05C83, 05C69
Mots-clés : graph minor, clique

David R. Wood  1

1 Monash University 
@article{10_37236_5715,
     author = {David R. Wood},
     title = {Cliques in graphs excluding a complete graph minor},
     journal = {The electronic journal of combinatorics},
     year = {2016},
     volume = {23},
     number = {3},
     doi = {10.37236/5715},
     zbl = {1344.05132},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/5715/}
}
TY  - JOUR
AU  - David R. Wood
TI  - Cliques in graphs excluding a complete graph minor
JO  - The electronic journal of combinatorics
PY  - 2016
VL  - 23
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/5715/
DO  - 10.37236/5715
ID  - 10_37236_5715
ER  - 
%0 Journal Article
%A David R. Wood
%T Cliques in graphs excluding a complete graph minor
%J The electronic journal of combinatorics
%D 2016
%V 23
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/5715/
%R 10.37236/5715
%F 10_37236_5715
David R. Wood. Cliques in graphs excluding a complete graph minor. The electronic journal of combinatorics, Tome 23 (2016) no. 3. doi: 10.37236/5715

Cité par Sources :