Abstract
Let G be a k-regular graph, k ≥ 3, with girth g. We prove that every embedding f : G → l2 has distortion Ω(√g). Two proofs are given, one based on Markov type [B] and the other on quadratic programming. In the core of both proofs are some Poincaré-type inequalities on graph metrics.
| Original language | American English |
|---|---|
| Pages (from-to) | 380-394 |
| Number of pages | 15 |
| Journal | Geometric and Functional Analysis |
| Volume | 12 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2002 |
| Externally published | Yes |
ASJC Scopus subject areas
- Analysis
- Geometry and Topology
Fingerprint
Dive into the research topics of 'Girth and euclidean distortion'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver