MathDB

We say that a group of

k

boys is

n-acceptable

if removing any boy from the group one can always find, in the other

k-1

group, a group of

n

boys such that everyone knows each other. For each

n

, find the biggest

k

such that in any group of

k

boys that is

n-acceptable

we must always have a group of

n+1

boys such that everyone knows each other.

Problem Statement