Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces.

Le Anh Vinh

The Electronic Journal of Combinatorics [electronic only] (2008)

  • Volume: 15, Issue: 1, page Research Paper R5, 18 p.-Research Paper R5, 18 p.
  • ISSN: 1077-8926

How to cite

top

Le Anh Vinh. "Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces.." The Electronic Journal of Combinatorics [electronic only] 15.1 (2008): Research Paper R5, 18 p.-Research Paper R5, 18 p.. <http://eudml.org/doc/117208>.

@article{LeAnhVinh2008,
author = {Le Anh Vinh},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research Paper R5, 18 p.-Research Paper R5, 18 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces.},
url = {http://eudml.org/doc/117208},
volume = {15},
year = {2008},
}

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 [electronic only]
PY - 2008
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 15
IS - 1
SP - Research Paper R5, 18 p.
EP - Research Paper R5, 18 p.
LA - eng
UR - http://eudml.org/doc/117208
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.