New answers tagged graph-theory
2
Constructive proof:
Consider a person P who won the greatest number of matches. (If there is a tie for most, choose any of them.) This person is a dominant player.
If P is not a dominant player, then some person Q beat P and every person P beat. But this is more people than P beat, contradicting the choice of P as the player with the most victories.
5
Unique solution?
Group A:
Group B:
And finally:
4
There may be other solutions, but:
Step 1:
Step 2:
Step 3:
Step 4:
Original Incorrect Answer - Oh boy, am I dumb.
Here is one solution, there may be others:
Next steps:
2
I think they must be
These letter pairs
EDIT: looks like this answer has a lot in common with @hexomino's earlier answer. I guess it couldn't be helped though.
6
So one key rule we must satisfy is that
However, this does not tie in with the title so I thought a better fit would be the following
0
As many have mentioned, there is no "inside the box" answer to the problem.
Depending on the exact statement of the problem, there may be trick answers. For example, as stated, the lines may not touch, but there is no rule against a line going through another circle in the middle of its route.
4
I know it is optimal:
Top 50 recent answers are included
