Geodesic
On kaleidoscopic pseudo-randomness of finite Euclidean graphs
Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 2, pp. 279-287

Voir la notice de l'article provenant de la source Library of Science

D. Hart, A. Iosevich, D. Koh, S. Senger and I. Uriarte-Tuero (2008) showed that the distance graphs has kaleidoscopic pseudo-random property, i.e. sufficiently large subsets of d-dimensional vector spaces over finite fields contain every possible finite configurations. In this paper we study the kaleidoscopic pseudo-randomness of finite Euclidean graphs using probabilistic methods.
Keywords: finite Euclidean graphs, kaleidoscopic pseudo-randomness 
@article{DMGT_2012_32_2_a7,
     author = {Vinh, Le},
     title = {On kaleidoscopic pseudo-randomness of finite {Euclidean} graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {279--287},
     publisher = {mathdoc},
     volume = {32},
     number = {2},
     year = {2012},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a7/}
}
TY  - JOUR
AU  - Vinh, Le
TI  - On kaleidoscopic pseudo-randomness of finite Euclidean graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2012
SP  - 279
EP  - 287
VL  - 32
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a7/
LA  - en
ID  - DMGT_2012_32_2_a7
ER  - 
%0 Journal Article
%A Vinh, Le
%T On kaleidoscopic pseudo-randomness of finite Euclidean graphs
%J Discussiones Mathematicae. Graph Theory
%D 2012
%P 279-287
%V 32
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a7/
%G en
%F DMGT_2012_32_2_a7
Vinh, Le. On kaleidoscopic pseudo-randomness of finite Euclidean graphs. Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 2, pp. 279-287. http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a7/