27 Feb '15 18:18>1 edit
It would be unfair of me to expect an airtight proof for this one, for reasons I will explain later. But maybe you can tell me what you think the answer probably is.
k is an arbitrary positive integer.
At Podunk College there are k committees, each consisting of k faculty members, and all committees meet in the same room, which has k chairs. At most one person belongs to the intersection of any two committees. The members have OCD, so... is it always possible to assign the committee members to chairs in such a way that each member sits in the same chair for all the different committees to which he or she belongs?
k is an arbitrary positive integer.
At Podunk College there are k committees, each consisting of k faculty members, and all committees meet in the same room, which has k chairs. At most one person belongs to the intersection of any two committees. The members have OCD, so... is it always possible to assign the committee members to chairs in such a way that each member sits in the same chair for all the different committees to which he or she belongs?