Abstract
We present both probabilistic and constructive lower bounds on the maximum size of a set of points ${\cal S} \subseteq {\Bbb R}^d$ such that every angle determined by three points in ${\cal S}$ is acute, considering especially the case ${\cal S} \subseteq\{0,1\}^d$. These results improve upon a probabilistic lower bound of Erdős and Füredi. We also present lower bounds for some generalisations of the acute angles problem, considering especially some problems concerning colourings of sets of integers.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献