Skip to main content
OlympiadHQ

Browse · MathNet

Print

BMO Short List

counting and probability

Problem

Let and be integers, and let be a subset of of size at least such that any two members of share some entry. Prove that there are an integer and members of such that and share the -th entry alone, whenever .

Miroslav Mironov, Bulgaria
Solution
Fix a member of . Note that there are at most -tuples that share at least two entries with . Indeed, there are -tuples sharing any two given entries. The bound now follows, since the two entries can be chosen in different ways.

Therefore, the number of members of that share a single entry with is at least Letting be the set of all members of that share the -th entry alone with , the above estimate yields , and hence for some .

Let be an arbitrary member of this . Then there are at most -tuples that share the -th entry and some other entry with . Now, let be maximal with the property that there are in such that any two and share the -th entry alone for . Hence any other member of shares with some at least one entry different from the -th. Consequently, .

Finally, compare the two bounds for to get , and conclude that are members of every two of which share the -th entry alone.

Techniques

Pigeonhole principleColoring schemes, extremal arguments