Maths Olympiad Prep

Library / /4 of 14

Combinatorics Difficulty 7.1 National Olympiad, round 2 Prove it European Girls' Mathematical Olympiad (EGMO)

Problem:

There are infinitely many people registered on the social network Mugbook. Some pairs of (different) users are registered as friends, but each person has only finitely many friends. Every user has at least one friend. (Friendship is symmetric; that is, if AA is a friend of BB, then BB is a friend of AA.)

Each person is required to designate one of their friends as their best friend. If AA designates BB as her best friend, then (unfortunately) it does not follow that BB necessarily designates AA as her best friend. Someone designated as a best friend is called a 1-best friend. More generally, if n>1n>1 is a positive integer, then a user is an nn-best friend provided that they have been designated the best friend of someone who is an (n1)(n-1)-best friend. Someone who is a kk-best friend for every positive integer kk is called popular.

a. Prove that every popular person is the best friend of a popular person.

b. Show that if people can have infinitely many friends, then it is possible that a popular person is not the best friend of a popular person.

Solutions — 2

Solution 1

Solution:

For any person AA, let f0(x)=xf^{0}(x)=x, let f(A)f(A) be AA's best friend, and define fk+1(A)=f(fk(A))f^{k+1}(A)=f\left(f^{k}(A)\right), so any person who is a kk-best friend is fk(A)f^{k}(A) for some person AA; clearly a kk-best friend is also an \ell-best friend for all <k\ell<k. Let XX be a popular person. For each positive integer kk, let xkx_{k} be a person with fk(xk)=Xf^{k}\left(x_{k}\right)=X. Because XX only has finitely many friends, infinitely many of the fk1(xk)f^{k-1}\left(x_{k}\right) (all of whom designated XX as best friend) must be the same person, who must be popular.

If people can have infinitely many friends, consider people XiX_{i} for positive integers ii and Pi,jP_{i, j} for i<ji<j positive integers. XiX_{i} designates Xi+1X_{i+1} as her best friend; Pi,iP_{i, i} designates X1X_{1} as her best friend; Pi,jP_{i, j} designates Pi+1,jP_{i+1, j} as her best friend if i<ji<j. Then all XiX_{i} are popular, but X1X_{1} is not the best friend of a popular person.

Solution 2

Solution:

For any set SS of people, let f1(S)f^{-1}(S) be the set of people who designated someone in SS as their best friend. Since each person has only finitely many friends, if SS is finite then f1(S)f^{-1}(S) is finite.

Let XX be a popular person and put V0={X}V_{0}=\{X\} and Vk=f1(Vk1)V_{k}=f^{-1}\left(V_{k-1}\right). All ViV_{i} are finite and (since XX is popular) nonempty.

If any two sets Vi,VjV_{i}, V_{j}, with 0i<j0 \leq i<j are not disjoint, define fi(x)f^{i}(x) for positive integers ii as in Solution 1. It follows fi(ViVj)fi(Vi)fi(Vj)V0Vji\emptyset \neq f^{i}\left(V_{i} \cap V_{j}\right) \subseteq f^{i}\left(V_{i}\right) \cap f^{i}\left(V_{j}\right) \subseteq V_{0} \cap V_{j-i}, thus XVjiX \in V_{j-i}. But this means that fji(X)=Xf^{j-i}(X)=X, therefore fn(ji)(X)=Xf^{n(j-i)}(X)=X. Furthermore, if Y=fji1(X)Y=f^{j-i-1}(X), then f(Y)=Xf(Y)=X and fn(ji)(Y)=Yf^{n(j-i)}(Y)=Y, so XX is the best friend of YY, who is popular.

If all sets VnV_{n} are disjoint, by König's infinity lemma there exists an infinite sequence of (distinct) xi,i0x_{i}, i \geq 0, with xiVix_{i} \in V_{i} and xi=f(xi+1)x_{i}=f\left(x_{i+1}\right) for all ii. Now x1x_{1} is popular and her best friend is x0=Xx_{0}=X.

If people can have infinitely many friends, proceed as in Solution 1.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.