William Elliot wrote: >mina_world wrote: > >> Hello~ teacher... >> >> 2n ambassadors are invited to a banquet. >> Every ambassador has at most (n-1) enemies. > >> Prove that the ambassadors can be seated around a round table, >> so that nobody sits next to an enemy. > >Let n = 2 and a,b,c all have the enemy d while d has no enemies.
For this problem, there is an implicit assumption that emnity is mutual.