A set of triplets from {1,2,...,n}
Source: Kürschák 1988, problem 2
July 20, 2014
combinatorics unsolvedcombinatorics
Problem Statement
Set has the property that for any two triplets and in , we have , and also, we know that at most one of the equalities , , holds. Maximize .