A new progress on Weak Dirac conjecture
Combinatorics
2016-07-29 v1
Abstract
In 2014, Payne-Wood proved that every non-collinear set of points in the Euclidean plane contains a point in at least lines determined by This is a remarkable answer for the conjecture, which was proposed by Erd\H{o}s, that every non-collinear set of points contains a point in at least lines determined by , for some constant In this article, we refine the result of Payne-Wood to give that every non-collinear set of points contains a point in at least lines determined by . Moreover, we also discuss some relations on theorem Beck that every set of points with at most collinear determines at least lines.
Cite
@article{arxiv.1607.08398,
title = {A new progress on Weak Dirac conjecture},
author = {Hoang-Ha Pham and Tien-Cuong Phi},
journal= {arXiv preprint arXiv:1607.08398},
year = {2016}
}