Kára–Pór–Wood Big-Line–Big-Clique Conjecture
Let be a finite planar point set. Two points of are visible if the open segment between them contains no other point of ; a mutually visible subset is a set whose pairs are all visible. Big-Line–Big-Clique Conjecture. For every pair of integers there is such that every set with contains either collinear points or mutually visible points. This is a Ramsey-type problem for planar point sets. The paper proves the conclusion in several structured regimes, including point sets on fixed irreducible algebraic curves, but the full conjecture remains open.
References
Primary source
Sohail Sarkar, “Visibility cliques, cubic containers, and dense orchard cores”, arXiv:2605.00918 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.