Proves that n-point sets with no k collinear points and most points on a cubic curve have visible cliques of size Omega(n) up to s exceptions, and extends this via Green-Tao and Elekes-Szabo to sets with bounded ordinary lines or on irreducible curves.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Visibility cliques, cubic containers, and dense orchard cores
Proves that n-point sets with no k collinear points and most points on a cubic curve have visible cliques of size Omega(n) up to s exceptions, and extends this via Green-Tao and Elekes-Szabo to sets with bounded ordinary lines or on irreducible curves.