From edge-disjoint paths to independent paths

Details From edge-disjoint paths to independent paths From edge-disjoint paths to independent paths

2012-03-20

arxiv.org/abs/1203.4483v1

Mathematics

Combinatorics

Scientific paper

Let f(k) denote the maximum such that every simple undirected graph
containing two vertices s,t and k edge-disjoint s-t paths, also contains two
vertices u,v and f(k) independent u-v paths. Here, a set of paths is
independent if none of them contains an interior vertex of another. We prove
that f(k)=k if k<3, and f(k)=3 otherwise.

Affiliated with

Also associated with

No associations

Rating

From edge-disjoint paths to independent paths 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 From edge-disjoint paths to independent paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and From edge-disjoint paths to independent paths will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-495616