3 ms·
No, that's what I'm saying. You're either a member of the 3-group or you're not. It clearly requires 3 members, so...
by bongodongobob 2y ago
No, that's what I'm saying. You're either a member of the 3-group or you're not. It clearly requires 3 members, so...
- Dylan16807 2y agoIt's proving the 3 nodes with no direct connections to each other that is the complicated part. It's not "you have a group of 3 or you don't". You can have all six people tangled up in lots of different combinations, so how do you prove there's a way to pick three that only connect indirectly?