MathDB

there exist $m$ subsets of $X$ such that each two of them are not disjoint

Source: Moldova TST 1996

August 8, 2023

Problem Statement

Let

X

be set with

n{}

elements,

n\in\mathbb{N}

. Find the greatest integer

m

(m\geq2)

for which there exist

m

subsets of

X

such that each two of them are not disjoint.