TITLE: Sylvester–Gallai theorem with circle version, plane version and curve version?
QUESTION [9 upvotes]: The Sylvester–Gallai theorem in geometry states that, given a finite number of points in the Euclidean plane, either

All the points are collinear; or
There is a line which contains exactly two of the points.

I think the theorem is also true for circle, plane version and curve version, can you give a proof of these versions?
Conjecture: (circle version):

Given a finite number of points in the Euclidean plane, either

All the points are concyclic; or
There is a circle which contains exactly three points.


Conjecture: (Plane version)

Given a finite number of points in the three-dimensional space, either

All the points in a plane; or
There is a plane which contains exactly three points.


Conjecture: (Curve version)

Let $n, N$ be the natural number with $(\frac{3n+n^2}{2} < N < \infty)$, give $N$ points in the Euclidean plane,  either

All the points lie on a curve of degree $n$; or
There is a curve of degree $n$ which contains exactly $\frac{3n+n^2}{2}$ of the points.

REPLY [5 votes]: The plane version is false as stated. Choose two skew lines $\ell_1$ and $\ell_2$ in $\mathbb{R}^3$ and place $\geq 3$ points on each of them. Any three of these points will either all lie on the same $\ell_i$ (and thus be collinear) or two of them will lie on the same $\ell_i$, so the plane they span contains that $\ell_i$ and thus contains three collinear points.
A true version is that there is a plane containing precisely $k$ of the points for which $k-1$ of them are collinear. This is due to Motzkin (Trans. AMS, 1951), with a higher dimensional generalization by Hansen (Math. Scand. 1965). I took the above counterexample from Hansen's paper.
I think the curve version should be false, but I haven't broken it yet. I have now discovered two papers: Wiseman and Wilson, (Disc. and Comp. Geom 1988) and Czapliński et. al., (Rendiconti del Seminario Matematico della Università di Padova 2016) which pose the curve version as an open question, so it probably isn't easy to resolve.