Pathwidth, trees, and random embeddings

Details Pathwidth, trees, and random embeddings Pathwidth, trees, and random embeddings

2009-10-08

arxiv.org/abs/0910.1409v2

Mathematics

Metric Geometry

Scientific paper

We prove that, for every $k=1,2,...,$ every shortest-path metric on a graph of pathwidth $k$ embeds into a distribution over random trees with distortion at most $c$ for some $c=c(k)$. A well-known conjecture of Gupta, Newman, Rabinovich, and Sinclair states that for every minor-closed family of graphs $F$, there is a constant $c(F)$ such that the multi-commodity max-flow/min-cut gap for every flow instance on a graph from $F$ is at most $c(F)$. The preceding embedding theorem is used to prove this conjecture whenever the family $F$ does not contain all trees.

Affiliated with

Also associated with

No associations

Rating

Pathwidth, trees, and random embeddings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pathwidth, trees, and random embeddings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pathwidth, trees, and random embeddings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-352338