English

Kirszbraun-type Theorems For Graphs

Combinatorics 2018-10-09 v3

Abstract

The classical Kirszbraun theorem says that all 11-Lipschitz functions f:ARnf:A\longrightarrow \mathbb{R}^n, ARnA\subset \mathbb{R}^n, with the Euclidean metric have a 11-Lipschitz extension to Rn\mathbb{R}^n. For metric spaces X,YX,Y we say that YY is XX-Kirszbraun if all 11-Lipschitz functions f:AYf:A\longrightarrow Y, AXA\subset X, have a 11-Lipschitz extension to~XX. We analyze the case when XX and YY are graphs with the usual path metric. We prove that Zd\mathbb{Z}^d-Kirszbraun graphs are exactly graphs that satisfies a certain Helly property. We also consider complexity aspects of these properties.

Keywords

Cite

@article{arxiv.1710.11007,
  title  = {Kirszbraun-type Theorems For Graphs},
  author = {Nishant Chandgotia and Igor Pak and Martin Tassy},
  journal= {arXiv preprint arXiv:1710.11007},
  year   = {2018}
}
R2 v1 2026-06-22T22:29:53.161Z