This note presents an upper bound of $1.252 n$ on the size of a set system that satisfies the mod-6 town rules. Under these rules the sizes of the sets are not congruent to $0\bmod 6$ while the sizes of all pairwise intersections are congruent to $ 0\bmod 6$.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。