Sets of points determining only acute angles and some related colouring problems

Tools

Bevan, David (2006) Sets of points determining only acute angles and some related colouring problems. The Electronic Journal of Combinatorics, 13 (1). R12. ISSN 1077-8926 (http://www.combinatorics.org/ojs/index.php/eljc/ar...)

[thumbnail of Bevan-EJC-2006-Sets-of-points-determining-only-acute-angles]
Preview
 Text. Filename: Bevan_EJC_2006_Sets_of_points_determining_only_acute_angles.pdf
Final Published Version
Download (237kB)| Preview

Abstract

We present both probabilistic and constructive lower bounds on the maximum size of a set of points S ⊆ R d such that every angle determined by three points in S is acute, considering especially the case S ⊆ {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.

ORCID iDs

Bevan, David ORCID logoORCID: https://orcid.org/0000-0001-7179-2285;
CORE (COnnecting REpositories)