Skip to main navigation Skip to search Skip to main content

Girth and euclidean distortion

Research output: Contribution to journalArticlepeer-review

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 languageAmerican English
Pages (from-to)380-394
Number of pages15
JournalGeometric and Functional Analysis
Volume12
Issue number2
DOIs
StatePublished - 2002
Externally publishedYes

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