Mengerian Theorems for Paths of Bounded Length

@inproceedings{Nashville2004MengerianTF,
  title={Mengerian Theorems for Paths of Bounded Length},
  author={PLUMMER Nashville},
  year={2004}
}
  • PLUMMER Nashville
  • Published 2004
Let u and v be non-adjacent points in a connected graph G . A classical result known to all graph theorists is that called MENGER's theorem . The point version of this result says that the maximum number of point-disjoint paths joining u and v is equal to the minimum number of points whose deletion destroys all paths joining u and v . The theorem may be proved purely in the language of graphs (probably the best known proof is indirect, and is due to DiRAC [3] while a more neglected, but direct… CONTINUE READING