3 search results - page 1 / 1 » Many collinear k-tuples with no k 1 collinear points |
CORR
2011
Springer
12 years 9 months ago
2011
Springer
For every k > 3, we give a construction of planar point sets with many collinear k-tuples and no collinear (k + 1)-tuples.
CCCG
2009
13 years 6 months ago
2009
We prove the following generalised empty pentagon theorem: for every integer 2, every sufficiently large set of points in the plane contains collinear points or an empty pentagon...
DAM
2011
13 years 7 days ago
2011
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...