Kirszbraun-type theorems for graphs
From MaRDI portal
Publication:2312599
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.
Recommendations
Cites work
- A constructive proof of Kirszbraun's theorem
- A Lipschitz Condition Preserving Extension for a Vector Function
- A variational principle for a non-integrable model
- Classical topics in discrete geometry
- Core congestion is inherent in hyperbolic networks
- Discrete differential geometry. Integrable structure
- Dismantling absolute retracts of reflexive graphs
- Extendability of Large-Scale Lipschitz Maps
- Extensions of distance reducing mappings to piecewise congruent mappings on R^ m.
- Fast domino tileability
- scientific article; zbMATH DE number 3508549 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 1789916 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 2125075 (Why is no real title available?)
- scientific article; zbMATH DE number 1404748 (Why is no real title available?)
- scientific article; zbMATH DE number 3214278 (Why is no real title available?)
- scientific article; zbMATH DE number 5044384 (Why is no real title available?)
- scientific article; zbMATH DE number 3280855 (Why is no real title available?)
- Kirszbraun's theorem and metric spaces of bounded curvature
- Metric graph theory and geometry: a survey
- On Helly hypergraphs with variable intersection sizes.
- Packing and Covering δ-Hyperbolic Spaces by Balls
- Straightening polygonal arcs and convexifying polygonal cycles
- Tile invariants: New horizons.
Cited in
(19)- Hofer-Zehnder capacity and Bruhat graph
- A generalization of Kneser graphs
- Deducing a variational principle with minimal \textit{a priori} assumptions
- Delocalization of uniform graph homomorphisms from \({\mathbb{Z}}^2\) to \({\mathbb{Z}} \)
- The Erdős-Ko-Rado theorem for twisted Grassmann graphs
- On \(b\)-continuity of Kneser graphs of type \(\mathrm{KG}(2k+1,k)\).
- Fine-Wilf graphs and the generalized Fine-Wilf theorem
- Levinson's theorem for graphs. II
- Definable versions of theorems by Kirszbraun and Helly
- On a theorem of Cvetković in graph theory
- Cerf Theory for Graphs
- Erdös-Ko-Rado theorem for ladder graphs
- scientific article; zbMATH DE number 908762 (Why is no real title available?)
- De Bruijn-Erdős-type theorems for graphs and posets
- scientific article; zbMATH DE number 6258250 (Why is no real title available?)
- Asymptotics for the number of standard tableaux of skew shape and for weighted lozenge tilings
- Continuity of extensions of Lipschitz maps and of monotone maps
- Two-sided Kirszbraun theorem
- Embedding Borel graphs into grids of asymptotically optimal dimension
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)