Kára–Pór–Wood Big-Line–Big-Clique Conjecture

From papers

Let AR2A\subset\mathbb{R}^2 be a finite planar point set. Two points of AA are visible if the open segment between them contains no other point of AA; a mutually visible subset is a set whose pairs are all visible. Big-Line–Big-Clique Conjecture. For every pair of integers k,2k,\ell\ge 2 there is n0(k,)n_0(k,\ell) such that every set AR2A\subset\mathbb{R}^2 with An0(k,)|A|\ge n_0(k,\ell) contains either kk collinear points or \ell 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.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Sohail Sarkar, “Visibility cliques, cubic containers, and dense orchard cores”, arXiv:2605.00918 (2026).

Solutions 0

No solutions have been posted yet.