3 ms·
I can’t get in your head to know what you’re thinking so maybe it is obvious to you, but just in case you don’t fully understand: it may not be obvious that its
by Moodles 5y ago
I can’t get in your head to know what you’re thinking so maybe it is obvious to you, but just in case you don’t fully understand: it may not be obvious that its impossible to have a configuration where in the 20 possible groups of 3, someone always knows someone else but not everyone knows everyone?
The theorem isn’t really saying “it’s A or not A”. It’s saying: “it has to be A or B and not anything else”.
- 8note 5y agoIf you pair everyone off, either all three groups are disjoint, or some of the groups are connected. If you don't pair people, you end up with 2 completely disconnected people and also at least one more person that's not connected to either Obviously if you make a group bigger than a pair, you also end up with 3 connected people