MathDB
Nordic MC 2008 Q2

Source:

March 3, 2013
combinatorics unsolvedcombinatorics

Problem Statement

Assume that n≥3n\ge 3 people with different names sit around a round table. We call any unordered pair of them, say M,NM,N, dominating if 1) they do not sit in adjacent seats 2) on one or both arcs connecting M,NM,N along the table, all people have names coming alphabetically after M,NM,N.
Determine the minimal number of dominating pairs.
Back to ProblemsView on AoPS