English

A general-position problem for planar line arrangements

Combinatorics 2026-07-28 v1

Abstract

For all δ>0\delta>0 and infinitely many nNn \in \mathbb N, we show that there exists a set LL of nn lines in R2\mathbb R^2 such that there are no intersecting quadruples, but for every subset LLL' \subset L such that Ln45+δ|L'| \geq n^{\frac{4}{5}+\delta}, there exist three lines from LL' with a common point of intersection. This gives an improved bound for a dual form of a theorem of Balogh and Solymosi. As a consequence, we derive an improved lower bound for the Hadwiger-Debrunner number HD2(p,3)HD_2(p,3). We also give, for all 0s10 \leq s \leq 1 and arbitrarily large nNn \in \mathbb N, a construction of a point set S[n]3S \subset [n]^3 with cardinality Sn3s|S|\geq n^{3-s}, such that SS contains O(n64s)O(n^{6-4s}) collinear triples. This shows that a supersaturation lemma of Balogh and Solymosi is optimal, up to logarithmic factors.

Cite

@article{arxiv.2607.25742,
  title  = {A general-position problem for planar line arrangements},
  author = {Oliver Roche-Newton},
  journal= {arXiv preprint arXiv:2607.25742},
  year   = {2026}
}