In September 2013, Ben Green and Terence Tao published a paper in which they prove that for all point sets of sufficient size, n > n0, there are at most (  + 1) = 3-point lines which matches the lower bound established by Burr, Grünbaum and Sloane.
在2013年九月, Ben Green和陶哲轩發表的一篇论文中，他们证明了所有的点集必然的大小，n > n0，至多有(  + 1) =  3点线，其中相應的下限由Burr, Grünbaum和Sloane確立。