Complement-pair capacity gain ($c(G\bigsqcup \bar{G})\ge 2\sqrt{|V(G)|}$)

In each word pattern with equally many $G$ and complement coordinates, pair the coordinates of the two types and put the same vertex label in each pair. Distinct labels are separated in one of the two graphs, making an independent code of size $n^m$ for a pattern of length $2m$. Distinct patterns lie in different graph components, so their codes combine to an independent set of size $\left(\genfrac{}{}{0ex}{}{2m}{m}\right)n^m$. Taking $2m$th roots gives the displayed bound.

Capacity of a disjoint union can strictly exceed the sum of the capacities. On the five-element subsets of a twenty-point set, join distinct sets when their intersection is odd. Linear polynomials over ${\mathbb{F}}_2$ bound its capacity by twenty; squarefree quadratic polynomials over ${\mathbb{F}}_3$ bound its complement's capacity by $\left(\genfrac{}{}{0ex}{}{20}{2}\right)=190$. The complement-pair lower bound is $2\sqrt{\left(\genfrac{}{}{0ex}{}{20}{5}\right)}>210$, establishing strict nonadditivity.