CombinatoricsResolved
A cyclic construction of triples in which every pair appears once
MOONL1T·
Counting suggests a Steiner triple system, but quoting an existence theorem feels much stronger than necessary. Can we explicitly construct the triples for 3n children when n is odd?
Problem:
In a school class with children, any two children make a common present to exactly one other child. Prove that for all odd it is possible that the following holds:
For any three children , and in the class, if and make a present to then and make a present to .
Source: Baltic Way 2008 · MNET-014V
Open MNET-014V in the question bank →