A new progress on Weak Dirac conjecture
Abstract
In 2014, Payne-Wood proved that every non-collinear set P of n points in the Euclidean plane contains a point in at least n37 lines determined by P. This is a remarkable answer for the conjecture, which was proposed by Erdos, that every non-collinear set P of n points contains a point in at least nc1 lines determined by P, for some constant c1. In this article, we refine the result of Payne-Wood to give that every non-collinear set P of n points contains a point in at least n26+2 lines determined by P . Moreover, we also discuss some relations on theorem Beck that every set P of n points with at most l collinear determines at least 161n(n-l) lines.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.