In a school there is a person with $l$ friends for all $1 \leq l \leq 99$. If there is no trio of students in this school, all three of whom are friends with each other, what is the minimum number of students in the school?
Source: 2023 Turkey Egmo TST P5
Tags: graph theory, combinatorics
In a school there is a person with $l$ friends for all $1 \leq l \leq 99$. If there is no trio of students in this school, all three of whom are friends with each other, what is the minimum number of students in the school?