Skip to content / Đến nội dung
ThichHocToan.com

MathNet 2017-part-04 — 176 problems (EN–VI) Question 169

Math Olympiad Vault · MathNet 2017-part-04 — 176 problems (EN–VI)

Question 169

Let $n$ be an integer greater than $1$ and let $X$ be an $n$-element set. A non-empty collection of subsets $A_1, \dots, A_k$ of $X$ is *tight* if the union $A_1 \cup \dots \cup A_k$ is a proper subset of $X$ and no element of $X$ lies in exactly one of the $A_i$s. Find the largest cardinality of a collection of proper non-empty subsets of $X$, no non-empty subcollection of which is tight.