PACKING ODD PATHS

Let s, t be vertices of a graph G, and let each edge e have a ''capacity'' c(e) is an element of R(+). We prove a conjecture of Cook and Sebo that for every k is an element of R(+), the following two statements are equivalent: (i) there is a ''fractional packing'' of value k of the odd length s-t paths, so that no edge is used more than its capacity; (ii) for every subgraph H of G with s, t is an element of V(H) in which there is no odd s-t path, [GRAPHICS] (C) 1994 Academic Press, Inc.