MathDB

Find the smallest number

n \geq 5

for which there can exist a set of

n

people, such that any two people who are acquainted have no common acquaintances, and any two people who are not acquainted have exactly two common acquaintances.
Bulgaria

Problem Statement