Question 3
At an applied-mathematics summer camp there are $8m+1$ boys, where $m>5$, and some girls. Each girl knows exactly three boys, and every two boys have exactly one girl whom they both know. Let $n$ be the largest number of girls that can be selected so that each boy knows at most one selected girl. Prove that $n\ge2m+1$.