![](/files/happy5.png)
Discrete Geometry
Big Line or Big Clique in Planar Point Sets ★★
Let be a set of points in the plane. Two points
and
in
are visible with respect to
if the line segment between
and
contains no other point in
.
Conjecture For all integers
there is an integer
such that every set of at least
points in the plane contains at least
collinear points or
pairwise visible points.
![$ k,\ell\geq2 $](/files/tex/badf6cb8e9340567fbf08b1790403654f6fa5c2e.png)
![$ n $](/files/tex/ec63d7020a64c039d5f6703b8fa3ab7393358b5b.png)
![$ n $](/files/tex/ec63d7020a64c039d5f6703b8fa3ab7393358b5b.png)
![$ \ell $](/files/tex/d2c5960dd9795a1b000a5843d282c97268e303c4.png)
![$ k $](/files/tex/c450c3185f7285cfa0b88d3a903c54f7df601201.png)
Keywords: Discrete Geometry; Geometric Ramsey Theory
![Syndicate content Syndicate content](/misc/feed.png)