Question 126
2018 people are registered in a social network, some of them are friends. It is known that Borya has the largest number of friends, and Zhenya has the smallest number of friends, and the total number of friends of Borya and Zhenya is not less than $k$. According to the rules established by the administrator, only friends can exchange messages. Anya and Masha are also registered in this social network, but they are not friends.
Find the smallest $k$ for which Anya is guaranteed to be able to send greetings to Masha, perhaps via other users?
(S. Chernov)
Find the smallest $k$ for which Anya is guaranteed to be able to send greetings to Masha, perhaps via other users?
(S. Chernov)