Xref: utzoo sci.math:12251 comp.theory:1015
Path: utzoo!attcan!uunet!bu.edu!rpi!zaphod.mps.ohio-state.edu!ub!boulder!ccncsu!webber.CS.ColoState.Edu!srimani
From: srimani@webber.CS.ColoState.Edu (pradip srimani)
Newsgroups: sci.math,comp.theory
Subject: Vertex Disjoint Paths in a graph
Message-ID: <8727@ccncsu.ColoState.EDU>
Date: 6 Sep 90 14:03:23 GMT
Sender: news@ccncsu.ColoState.EDU
Reply-To: srimani@webber.CS.ColoState.Edu (pradip srimani)
Organization: Colorado State University
Lines: 17

I have a problem as follows: Consider a symmetric graph G of
vertex connectivity m. Then consider an arbitrary vertex s and
another set of m arbitrary vertices d1, d2, ... . Is it true
that we can always find vertex disjoint paths from s to each
of these vertices di ? I can't prove or disprove it. If the
claim is not true, is it true in case of vertex symmetric
graphs of connectivity m ?

I'll be grateful if anyone can give me any pointers to
existing literature or throw any light on the problem. Thank
you so much.

Pradip
=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=

Pradip K Srimani
Department of Computer Science