MathDB
a subset of points in the plane

Source: Iran TST 2012 -first day- problem 3

April 23, 2012
algebrapolynomialfunctionvectorinductioncombinatorics proposedcombinatorics

Problem Statement

Let nn be a positive integer. Let SS be a subset of points on the plane with these conditions:
i)i) There does not exist nn lines in the plane such that every element of SS be on at least one of them.
ii)ii) for all XSX \in S there exists nn lines in the plane such that every element of SXS - {X} be on at least one of them.
Find maximum of S\mid S\mid.
Proposed by Erfan Salavati