Abstract
We prove that any set of points in , any three of which form an angle less than , has size for sufficiently small . The proof is based on a refinement of an approach by Erdős and Füredi. The lower bound is relying on a problem about large hypegraphs with small edge intersections, while the upper bound is tightly connected to the problem of packing disjoint caps on a sphere.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.