Fig. 6

Feasible exponential storage. (a) The shaded region is the feasible polytope for network parameters giving clique storage for \(5 \leq k \leq15\). Black points are its vertices, the red \(R_{k}\) and blue \(B_{k}\) lines are linear constraints. (b) Lines \(R_{k}\) (red) and \(B_{k}\) (blue) for \(1000 \leq k \leq5500\). Note the appearance of the smooth curve Q enveloping the family \(B_{k}\) in the figure