Large cliques in extremal incidence configurations
Tuomas Orponen
University of Jyväskylä, Jyväskylä, FinlandGuangzeng Yi
University of Jyväskylä, Jyväskylä, Finland

Abstract
Let be a Katz–Tao -set, and let be a Katz–Tao -set of lines in . A recent result of Fu and Ren gives a sharp upper bound for the -covering number of the set of incidences . In fact, for ,
where . For , we characterise the near-extremal configurations of this inequality: we show that if , then contains “cliques” satisfying ,
Cite this article
Tuomas Orponen, Guangzeng Yi, Large cliques in extremal incidence configurations. Rev. Mat. Iberoam. (2025), published online first
DOI 10.4171/RMI/1552