KöMaL 2019 A747

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.

Official text KöMaL. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.