There exist finite universal immersion spaces for the following: (a) Edge-colored graphs of bounded degree and boundedly many colors. (b) Nearest-neighbor metrics of bounded degree and boundedly many edge lengths

Bartal, Yair

Schulman, Leonard J.

English

Caltech Authors - Main

Universal immersion spaces for edge-colored graphs and nearest-neighbor metrics

Acyclic coloring of graphs of maximum degree Δ,

Acyclic colorings of planar graphs,

Acyclic colourings of graphs,

Approximate nearest neighbors: Towards removing the curse of dimensionality,

Efficient search for approximate nearest neighbor in high dimensional spaces,

Homomorphisms of edge-coloured graphs and Coxeter groups,

Induced-universal graphs for graphs with bounded maximum degree,

Local embedding of metric spaces,

On minimal n-universal graphs,

Remarks on some theorems of Rado on universal graphs,

The singularities of a smooth n-manifold in (2n −

Universal graphs and universal functions,

http://authors.library.caltech.edu/14745/1/Bartal2009p4687SIAM_Journal_on_Discrete_Mathematics.pdf

Universal immersion spaces for edge-colored graphs and nearest-neighbor metrics

Abstract

Similar works

Full text

Available Versions

Caltech Authors - Main