More about lower bounds for the number of k-facets
Oswin Aichholzer, Jesús García López de Lacalle, David Orden, Pedro A. Ramos · Hispana · 2008
In this paper we present two results dealing with the number of (• k)-facets of a set of points: •² In R2, we use the notion of ²-net to give structural properties of sets that achieve the optimal lower bound 3¡k+22 ¢ of (• k)-edges for a ¯xed 0 • k • bn=3c ¡ 1;² •In Rd, we show that for k < bn=(d + 1)c the number of (• k)-facets of a set of n points in general position is at least (d + 1)¡k+dd ¢, and that this bound is tight in that range.