Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

For a given metric $d$ on a finite (vertex) set $V$, how can I bound the largest edge length in $O(|V|)$? While (wlog) assuming that the smallest edge length is at least $1$.

share|cite|improve this question

HINT: You’ll need to use the triangle inequality. Its basic form says that for any $x,y,z\in V$,

$$d(x,z)\le d(x,y)+d(y,z)\;.$$

Generalize this: for any $x,y_1,\dots,y_n,z\in V$,

$$d(x,z)\le d(x,y_1)+\sum_{k=1}^{n-1}d(y_k,y_{k+1})+d(y_n,z)\;.$$

A proof by induction on $n$ seems indicated.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.