Digital Commons Network^™

The Maximum Number Of Complete Subgraphs Of Fixed Size In A Graph With Given Maximum Degree, Jonathan Cutler, A. J. Radcliffe

Department of Mathematics Facuty Scholarship and Creative Works

In this article, we make progress on a question related to one of Galvin that has attracted substantial attention recently. The question is that of determining among all graphs G with n vertices and Δ(G) ≤ r, which has the most complete subgraphs of size t, for t≥3. The conjectured extremal graph is aKr+1 ∪ Kb, where n = a(r + 1) + b with 0 ≤ b ≤ r. Gan et al. (Combin Probab Comput 24(3) (2015), 521–527) proved the conjecture when a ≤ 1, and also reduced the general conjecture to the case t = 3. We prove …