Kirszbraun-type Theorems For Graphs
Combinatorics
2018-10-09 v3
Abstract
The classical Kirszbraun theorem says that all -Lipschitz functions , , with the Euclidean metric have a -Lipschitz extension to . For metric spaces we say that is -Kirszbraun if all -Lipschitz functions , , have a -Lipschitz extension to~. We analyze the case when and are graphs with the usual path metric. We prove that -Kirszbraun graphs are exactly graphs that satisfies a certain Helly property. We also consider complexity aspects of these properties.
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}
}