Kirszbraun-type theorems for graphs

From MaRDI portal
Publication:2312599



Abstract: The classical Kirszbraun theorem says that all 1-Lipschitz functions f:AlongrightarrowmathbbRn, AsubsetmathbbRn, with the Euclidean metric have a 1-Lipschitz extension to mathbbRn. For metric spaces X,Y we say that Y is X-Kirszbraun if all 1-Lipschitz functions f:AlongrightarrowY, AsubsetX, have a 1-Lipschitz extension to~X. We analyze the case when X and Y are graphs with the usual path metric. We prove that mathbbZd-Kirszbraun graphs are exactly graphs that satisfies a certain Helly property. We also consider complexity aspects of these properties.




Cites work









This page was built for publication: Kirszbraun-type theorems for graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2312599)