带通配符的压缩：图的所有或所有最大反团
Compression with wildcards: All, or all maximum, anticlques of a graph
AI总结：
本文提出用带通配符的压缩格式表示图的所有反团及最大基数反团，该方法在二分图等König-Egerváry图上效果良好，涉及2-CNF布尔函数与Dilworth格的应用。
摘要：
根据定义，反团是图G的顶点独立集，由对偶性，所有关于反团的结果都可推广到团（出于技术原因，本文全程采用反团）。本文用带通配符的压缩格式表示图G的所有反团构成的集合Acl(G)，对最大基数反团子族MACL(G)⊆Acl(G)也做了压缩（压缩程度稍低）。该任务在二分图（更广泛的König-Egerváry图类）上表现尤佳，此场景下2-CNF型布尔函数将发挥重要作用，偏序集的所有最大反链构成的Dilworth格也占据重要地位。
英文摘要：
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)\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önig-Egarváry 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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
