We are given a graph $G=(V,E)$, which has clique number $k$. The graph invariant in question is given by
$$q(g)=\min_T \min_{A\subset T} |T|-|A|$$$$q_{\mathrm{a}}(G)=\min_T \min_{A\subset T} |T|-|A|$$
Wherewhere $T$ is a transversal of the maximum cliques;cliques of $G$; that is, a set with nonempty intersection with every $k$-clique, and $A$ a subset of $T$ that is an independent set in $G$. The question is this: how large can this quantity$q_{\mathrm{a}}(G)$ get compared to the number of vertices $|V|$, of the graph $G$? The key figure of merit is
$$q_k= \sup_{G, \, \omega(G)=k}q_r(G) ,$$$$q_k= \sup_{G, \, \omega(G)=k}q(G) ,$$ where $$q_r(G)=\frac{q(G)}{|G|}.$$$$q(G)=\frac{q_{\mathrm{a}}(G)}{|G|}.$$
Both upper and lower bounds are of great interest.
This problem is motivated by quantum foundations considerations, that I could elucidate if helpful.