The Thinking Board

The handshake lemma

The room

Not for the board · 0 of 5

The problem

At a gathering, some pairs of people shake hands. No pair shakes more than once, and nobody shakes their own hand.

Show that the number of people who shook an odd number of hands is even.

Said in the language of graphs: in any finite graph, the number of vertices of odd degree is even.

0 proofs posted

0 votes cast
Most convincingNewest

No proofs yet

Be the first to put an argument on the board.

Add a proof