Copy the page URI to the clipboard
Bevan, David
(2006).
URL: http://www.combinatorics.org/ojs/index.php/eljc/ar...
Abstract
We present both probabilistic and constructive lower bounds on the maximum size of a set of points such that every angle determined by three points in
is acute, considering especially the case
. 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.
Viewing alternatives
Download history
Item Actions
Export
About
- Item ORO ID
- 33661
- Item Type
- Journal Item
- ISSN
- 1077-8926
- Academic Unit or School
-
Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM) - Copyright Holders
- © 2006 David Bevan
- Related URLs
- Depositing User
- David Bevan