Compression with wildcards: All, or all maximum, anticlques of a graph

By definition an anticlique is an independent set of vertices of a graph $G$. By duality all results obtained for anticliques carry over to cliques. (It is for technical reasons that we stick with anticliques throughout.) We display the set $Acl(G)$ of all anticliques of $G$ in a compressed format that uses wildcards. Likewise (albeit less compressed) for the subfamily $MACL(G)\text{s}Acl(G)$ of all maximum-cardinality members. The second task works particularly well for bipartite graphs (in fact for the broader class of K"onig-Egarv'ary graphs). In this scenario Boolean functions (of type 2-CNF) will be important. Dilworth’s lattice of all maximum antichains of a poset also features prominently.