Classical looking graph
Source: Iranian Our MO 2020 P4
March 11, 2020
graph theorycombinatorics
Problem Statement
In a school there are classes and student. We know that in this school every two students have attended exactly in one common class. Also due to smallness of school each class has less than students. If is not a perfect square, prove that there exist a student that has attended in at least classes.Proposed by Mohammad Moshtaghi Far, Kian Shamsaie Rated 4