Explicit Ramsey graphs and Erdos distance problem over finite Euclidean and non-Euclidean spaces

Simple item page
dc.creatorVinh, Le Anh
dc.date2007-11-22
dc.date.accessioned2026-07-07T09:19:23Z
dc.date.available2026-07-07T09:19:23Z
dc.descriptionWe study the Erdos 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 Erdos distance problems with explicit constants. Second, we can construct many explicit tough Ramsey graphs R(3,k).
dc.identifierhttps://arxiv.org/abs/0711.3508
dc.identifierhttp://arxiv.org/abs/0711.3508
dc.identifierThe Electronics Journal of Combinatorics, 15 (2008), R5
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/154371
dc.subjectCombinatorics
dc.subject05C35; 05C38; 05C55; 05C25
dc.titleExplicit Ramsey graphs and Erdos distance problem over finite Euclidean and non-Euclidean spaces
dc.typetext

Files

Collections

arXiv