This paper considers the following question: What is the maximum number of k-cliques in an n-vertex graph with no Kt-minor? This question generalises the extremal function for Kt-minors, which corresponds to the k = 2 case. The exact answer is given for t ≤ 9 and all values of k. We also determine the maximum total number of cliques in an n-vertex graph with no Kt-minor for t ≤ 9. Several observations are made about the case of general t.
|Number of pages||16|
|Journal||Electronic Journal of Combinatorics|
|Publication status||Published - 5 Aug 2016|
- Graph theory