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
Everybody but Byron has one handshake and Byron has n-1, with n the number of people
I think the problem with the suggestion is that the solution to the even subgraph may not be under your control? Not sure.