MathDB
Problems
Contests
International Contests
IMO Longlists
1985 IMO Longlists
61
61
Part of
1985 IMO Longlists
Problems
(1)
Maximal value of k
Source:
9/14/2010
Consider the set
A
=
{
0
,
1
,
2
,
…
,
9
}
A = \{0, 1, 2, \dots , 9 \}
A
=
{
0
,
1
,
2
,
…
,
9
}
and let
(
B
1
,
B
2
,
…
,
B
k
)
(B_1,B_2, \dots , B_k)
(
B
1
,
B
2
,
…
,
B
k
)
be a collection of nonempty subsets of
A
A
A
such that
B
i
∩
B
j
B_i \cap B_j
B
i
∩
B
j
has at most two elements for
i
≠
j
i \neq j
i
=
j
. What is the maximal value of
k
?
k \ ?
k
?
combinatorics unsolved
combinatorics