You manage a gang with infinitely many gangsters. Each gangster in the gang has a finite number of enemies who will try to kill him if they meet. This hatred relation is commutative: whenever A wants to kill B, B wants to kill A.
You want to organize a meeting with infinitely members of the gang, but you want to avoid shoot-outs. So, you have to choose the gangsters in such a way that no 2 gangsters are enemies. How can you do that? What's the choice algorithm?
Does this require the axiom of choice?
2007-12-12
02:20:42
·
1 answers
·
asked by
Steiner
7