A Sylvester-Gallai result for concurrent lines in the complex plane
Combinatorics
2020-09-30 v2
Abstract
We show that if a set of points in lies on a family of concurrent lines, and if one of those lines contains more than points, then there is a line passing through exactly two points of the set. The bound in our result is optimal. Our main theorem resolves a conjecture of Frank de Zeeuw, and generalizes a result of Kelly and Nwankpa.
Cite
@article{arxiv.2007.03601,
title = {A Sylvester-Gallai result for concurrent lines in the complex plane},
author = {Alex Cohen},
journal= {arXiv preprint arXiv:2007.03601},
year = {2020}
}
Comments
16 pages, 6 figures; several revisions added for overall clarity