New to combinatorics (second lesson in the course). I'd like you to explain to me how to solve the following problem.
Consider this:
We have two classes of students, A and B.
In class A: every student except Dan knows exactly 12 students from class B, Dan knows exactly 8 students from class B
In class B: every student knows exactly 8 students from class A we know that class B contains 43 students
We need to find the number of students in class A.
To be honest, I don't know where to start -
I know that class A contains more than 8 students (if 8 then in this case every student in a knows 43 students in class b).
I feel that we need to apply the pigeonhole principle to solve this problem but I don't know where.
Please help me understand how to address this kind of problem.
We know there are at least $8$ students in class $A$, but to go any further we have to assume that "knowing" is a reflexive relation, that is: "$c$ knows $d$" $\iff$ "$d$ knows $c$".
Given that assumption, it seems more like simple graph theory, with students as nodes and "$c$ knows $d$" represented as an edge; a bipartite graph of part $A$ and $B$ with $8\times 43=344$ edges connecting the parts.
Then Dan accounts for $8$ of these edges on the $A$ side and there are $(344-8)/12=28$ other students in class $A$.