Geodesic
Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We study the Erdős distance problem over finite Euclidean and non-Euclidean spaces. Our main tools are graphs associated to finite Euclidean and non-Euclidean spaces that are considered in Bannai-Shimabukuro-Tanaka (2004, 2007). These graphs are shown to be asymptotically Ramanujan graphs. The advantage of using these graphs is twofold. First, we can derive new lower bounds on the Erdős distance problems with explicit constants. Second, we can construct many explicit tough Ramsey graphs $R(3,k)$.
DOI : 10.37236/729
Classification : 05C35, 05C12, 05C55, 52C10 
@article{10_37236_729,
     author = {Le Anh Vinh},
     title = {Explicit {Ramsey} graphs and {Erd\H{o}s} distance problems over finite {Euclidean} and {non-Euclidean} spaces},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/729},
     zbl = {1206.05054},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/729/}
}
TY  - JOUR
AU  - Le Anh Vinh
TI  - Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/729/
DO  - 10.37236/729
ID  - 10_37236_729
ER  - 
%0 Journal Article
%A Le Anh Vinh
%T Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/729/
%R 10.37236/729
%F 10_37236_729
Le Anh Vinh. Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/729

Cité par Sources :