Visibility cliques, cubic containers, and dense orchard cores
Sohail Sarkar

TL;DR
This paper proves a cubic-container theorem related to the Big-Line-Big-Clique Conjecture, providing structural insights into large planar point sets with limited collinearity and visibility properties.
Contribution
It introduces a deterministic cubic-container theorem and combines it with existing theorems to advance understanding of visibility and collinearity in structured point sets.
Findings
Sets with no $k$ collinear points contain large visible cliques
Most points in such sets can be partitioned into a few mutually visible subsets
The results extend to points on algebraic curves and dense orchard cores
Abstract
The Big-Line-Big-Clique Conjecture of Kara, Por and Wood asserts that, for every fixed and , every sufficiently large finite planar point set contains either collinear points or pairwise visible points. We prove a quantitative form in two structured regimes and isolate the precise ambient obstruction to the full conjecture. The main result is a deterministic cubic-container theorem. If has points, no collinear points, and all but points of lie on a real cubic, then the cubic-supported part of has a visible clique cover of size ; in particular contains a clique of size , unless the cubic is the excluded three-line case containing only points. Combining this with the Green-Tao structure theorem, we obtain that every -point set with no collinear points and at most …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
