BALKAN 1994 Problem 4
- Paper
Find the smallest number for which there can exist a set of 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
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.