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

Yair Bartal; Leonard J. Schulman

doi:10.1137/08071555X

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

Yair Bartal^*
, Leonard J. Schulman

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	1110-1115
Number of pages	6
Journal	SIAM Journal on Discrete Mathematics
Volume	23
Issue number	2
DOIs	https://doi.org/10.1137/08071555X
State	Published - 2009

Keywords

Edge coloring
Embedding
Finite metric
Homomorphism
Immersion
Universal graph
Universal space

Access to Document

10.1137/08071555X

Cite this

@article{1a0b6f59dd114fc7be705329de3b5c95,

title = "Universal immersion spaces for edge-colored graphs and nearest-neighbor metrics",

abstract = "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.",

keywords = "Edge coloring, Embedding, Finite metric, Homomorphism, Immersion, Universal graph, Universal space",

author = "Yair Bartal and Schulman, \{Leonard J.\}",

year = "2009",

doi = "10.1137/08071555X",

language = "אנגלית",

volume = "23",

pages = "1110--1115",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "2",

}

TY - JOUR

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

AU - Bartal, Yair

AU - Schulman, Leonard J.

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - Edge coloring

KW - Embedding

KW - Finite metric

KW - Homomorphism

KW - Immersion

KW - Universal graph

KW - Universal space

UR - https://www.scopus.com/pages/publications/73349100294

U2 - 10.1137/08071555X

DO - 10.1137/08071555X

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:73349100294

SN - 0895-4801

VL - 23

SP - 1110

EP - 1115

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 2

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this