Packing edge disjoint cliques in graphs

József Balogh, Michael C. Wigal

Let $r\ge 3$ be fixed and $G$ be an $n$-vertex graph. A long-standing conjecture of Győri states that if $e(G)=t_{r-1}(n)+k$, where $t_{r-1}(n)$ denotes the number of edges of…