A general-position problem for planar line arrangements
Combinatorics
2026-07-28 v1
Abstract
For all and infinitely many , we show that there exists a set of lines in such that there are no intersecting quadruples, but for every subset such that , there exist three lines from 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 . We also give, for all and arbitrarily large , a construction of a point set with cardinality , such that contains 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}
}