Many holes but no large one: maximizing k-holes while forbidding (k+1)-holes

Abstract

We study the maximal number mk,,n of empty convex k-gons (k-holes) determined by an n-point set in the plane in general position that contains no empty convex ~-gon, focusing on the first nontrivial case =k+1. Our main result determines the exact value in the small-excess regime: for n=k+a with a k/2-1, we prove mk,k+1,k+a=2a. We also describe the extremal configurations attaining equality. Beyond this exact range, we provide upper and lower bounds in the proportional regime n=αk and in the regime where k is fixed and n goes to infinity. In the last mentioned regime we prove that mk,k+1,n=Ωk(nk3) and mk,k+1,n=Ok(nk2+1).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…