On the Largest Convexity Number of Co-Finite Sets in the Plane

preprint2026arXivOpen access

Abstract

The convexity number of a set X⊂R2X \subset \mathbb{R}^2 is the minimum number of convex subsets required to cover it. We study the following question: what is the largest possible convexity number f(n)f(n) of R2∖S\mathbb{R}^2 \setminus S, where SS is a set of nn points in general position in the plane? We prove that for all n≥4n \geq 4, ⌊n+52⌋≤f(n)≤7n+4411\lfloor\frac{n+5}{2}\rfloor \leq f(n) \leq \frac{7n+44}{11}. We also show that for every n≥4n \geq 4, if the points of SS are in convex position then the convexity number of R2∖S\mathbb{R}^2 \setminus S is ⌊n+52⌋\lfloor\frac{n+5}{2}\rfloor. This solves a problem of Lawrence and Morris [Finite sets as complements of finite unions of convex sets, Disc. Comput. Geom. 42 (2009), 206-218].

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.