Solve the route problem (solution number 6 Shortlist problem in IMO 2016 about combinatoric )

Problem Combinatoric 6:

There are n\geqslant 3 islands in a city. Initially, the ferry company offers some routes between some pairs of islands so that it is impossible to divide the islands into two groups such that no two islands in different groups are connected by a ferry route.

After each year, the ferry company will close a ferry route between some two islands X and Y. At the same time, in order to maintain its service, the company will open new routes according to the following rule: for any island which is connected by a ferry route to exactly one of X and Y , a new route between this island and the other of X and Y is added.

Also Read:

Suppose at any moment, if we partition all islands into two nonempty groups in any way, then it is known that the ferry company will close a certain route connecting two islands from the two groups after some years. Prove that after some years there will be an island which is connected to all other islands by ferry routes.


Initially, we pick any pair of islands A and B which are connected by a ferry route and put A in set A and B in set B. From the condition, without loss of generality there must be another island which is connected to A. We put such an island C in set B. We say that two sets of islands form a network if each island in one set is connected to each island in the other set.

Next, we shall included all islands to A\cup B one by one. Suppose we have two sets A and B which form a network where 3\leqslant |A\cup B|<n. This relation no longer holds only when a ferry route between islands A\in A and B\in B is closed. In that case, we define A’ = {A, B}, and B’ = (A\cup B) – {A, B}. Note that B’ is nonempty. Consider any island C\in A – { A }. From the relation of A and B, we know that C is connected to B. If C was not connected to A before the route between A and B closes, then there will be a route added between C and A afterwards. Hence, C must now be connected to both A and B. The same holds true for any island in B – {B}. Therefore, A’ and B’ form a network, and A'\cup B'=A\cup B. Hence these islands can always be partitioned into sets A and B which form a network.

As |A\cup B|<n, there are some islands which are not included in A\cup B. From the condition, after some years there must be a ferry route between an island A in A\cup B and an island D outside A\cup B which closes. Without loss of generality assume A\in A. Then each island in B must then be connected to D, no matter it was or not before. Hence, we can put D in set A so that the new sets A and B still form a network and the size of A\cup B is increased by 1. The same process can be done to increase the size of A\cup B. Eventually, all islands are included in this way so we may now assume |A\cup B|=n.

Suppose a ferry route between A\in A and B\in B is closed after some years. We put A and B in set A’ and all remaining islands in set B’. Then A’ and B’ form a network. This relation no longer holds only when a route between A, without loss of generality, and C\in B' is closed. Since this must eventually occur, at that time island B will be connected to all other islands and the result follows.

Also Read : Shortlist problem Combinatorics in IMO 2016 ( international mathematic Olympiad)

%d bloggers like this: