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.