As a common generalization of matchings and matroid intersections, W.H. Cunningham and J.F. Geelen introduced the notion of path-matchings. They proved a min-max formula for the maximum value. Here, we exhibit a simplified version of their min-max theorem and provide a purely combinatorial proof. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 110119, 2002#R##N##R##N#Andras Frank and Laszlo Szego, are the members of the Egervary Research Group (EGRES).
['András Frank', 'László Szegő']
Note on the path-matching formula