Clique conflict graph
= Clique conflict graph
The clique conflict graph has one <vertex> for each $r$-<clique> of a fixed <graph>, and joins two when they share an <edge>. Its <independent sets> correspond exactly to <edge-disjoint clique packings>. The <Caro-Wei bound> converts clique-count and overlap estimates into a packing lower bound.