MathDB
Air companies !!

Source: Romania TST 2015 Day 5 Problem 2

June 4, 2015
graph theorycombinatoricsRomanian TST

Problem Statement

Let nn be an integer greater than 11, and let pp be a prime divisor of nn. A confederation consists of pp states, each of which has exactly nn airports. There are pp air companies operating interstate flights only such that every two airports in different states are joined by a direct (two-way) flight operated by one of these companies. Determine the maximal integer NN satisfying the following condition: In every such confederation it is possible to choose one of the pp air companies and NN of the npnp airports such that one may travel (not necessarily directly) from any one of the NN chosen airports to any other such only by flights operated by the chosen air company.