Edge-disjoint clique packing
= Edge-disjoint clique packing
{title2=$Z_r(G)$}
An edge-disjoint clique packing is a collection of $r$-<cliques> no two of which share an <edge>; they may share <vertices>. Its maximum cardinality $Z_r(G)$ changes by at most one when a single <edge> is toggled. Removing that <edge> destroys at most one packed <clique>, which makes this variable suitable for an <edge-exposure martingale>.