News for hackers. Stuff that matters.
Re:What a Math Party Game Tells Us About Graph Theory by croes on Friday April 08, 2022 @11:23AM (#30958321)
Isn't the simplest solution that everybody shakes hand with Byron?

Everybody but Byron has one handshake and Byron has n-1, with n the number of people

Re:What a Math Party Game Tells Us About Graph Theory by bitslayer on Friday April 08, 2022 @11:38AM (#30958578)
Depending on your definition of simpler, everyone could just pair off and shake exactly one hand.
Re:What a Math Party Game Tells Us About Graph Theory by xboxnolifes on Friday April 08, 2022 @11:57AM (#30958852)
It's the simplest option when n is even (which it is in this case), but fails when n is odd.
Re:What a Math Party Game Tells Us About Graph Theory by lupire on Friday April 08, 2022 @11:57AM (#30958855)
The article about how this problem is trivial for N even but impossible for N odd.
Re:What a Math Party Game Tells Us About Graph Theory by vlovich123 on Friday April 08, 2022 @12:15PM (#30959032)
The article is talking about the biggest odd subgraph within the even subgraph solution.

I think the problem with the suggestion is that the solution to the even subgraph may not be under your control? Not sure.