Library / /59 of 151

, 2019

Combinatorics Difficulty 6.0 National Olympiad Prove it Hungary

In a simple graph on $n$ vertices, every set of $k$ vertices has an odd number of common neighbours. Prove that $n+k$ must be odd.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.