Geodesic
Sets of points determining only acute angles and some related colouring problems
The electronic journal of combinatorics, Tome 13 (2006)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/1038
Classification : 05D40, 51M16
Mots-clés : probabilistic 
@article{10_37236_1038,
     author = {David Bevan},
     title = {Sets of points determining only acute angles and some related colouring problems},
     journal = {The electronic journal of combinatorics},
     year = {2006},
     volume = {13},
     doi = {10.37236/1038},
     zbl = {1081.05103},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1038/}
}
TY  - JOUR
AU  - David Bevan
TI  - Sets of points determining only acute angles and some related colouring problems
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1038/
DO  - 10.37236/1038
ID  - 10_37236_1038
ER  - 
%0 Journal Article
%A David Bevan
%T Sets of points determining only acute angles and some related colouring problems
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1038/
%R 10.37236/1038
%F 10_37236_1038
David Bevan. Sets of points determining only acute angles and some related colouring problems. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1038

Cité par Sources :