Originally Posted by

**mbluo** FOr some reason our algebra II teacher gave us this on a quiz...its like what is this?? total brute force, but i cna seem to do it...i know a little bit of graph theory, but is there a easy way to do this?

Say that there are "p" students in the classroom. For EACH integer number "q" from [0,10], one can choose 5 studnets such that exctly "q" of them know eachother. What is the minimal possible value for "p"/

A. 9 B. 10 C. 11 D. 12 E. None of the above

anybody know how to do this with Graph Theorey? What about normally?