MathDB
Problems
Contests
Undergraduate contests
Miklós Schweitzer
2010 Miklós Schweitzer
3
3
Part of
2010 Miklós Schweitzer
Problems
(1)
Maximum number of subsets
Source: Miklós Schweitzer 2010 ,P3
9/9/2020
Let
A
i
,
i
=
1
,
2
,
…
,
t
A_i,i=1,2,\dots,t
A
i
,
i
=
1
,
2
,
…
,
t
be distinct subsets of the base set
{
1
,
2
,
…
,
n
}
\{1,2,\dots,n\}
{
1
,
2
,
…
,
n
}
complying to the following condition
A
i
∩
A
k
⊆
A
j
\displaystyle A_ {i} \cap A_ {k} \subseteq A_ {j}
A
i
∩
A
k
⊆
A
j
for any
1
≤
i
<
j
<
k
≤
t
.
1 \leq i <j <k \leq t.
1
≤
i
<
j
<
k
≤
t
.
Find the maximum value of
t
.
t.
t
.
Thanks @dgrozev
college contests
Miklos Schweitzer
combinatorics
set theory
Subsets