Library / /51 of 151

, 2015

Combinatorics Difficulty 6.0 National Olympiad Find the answer Hungary

Determine whether there is a finite, nonempty subset $S$ of the square grid in the plane such that every element of $S$ has at least two neighbours in $S$ and $S$ does not contain four points that are the vertices of a square (with sides not necessary parallel to the coordinate axes)?
Proposed by: Mátyás Sustik, San Francisco
(5 pont)

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.