Note on the path-matching formula

Authors:
András Frank;László Szegő
Affiliations:
Department of Operations Research, EöTVöS University, Pázmány Péter Sétány 1-C, Budapest, Hungary H-1117 and Ericsson Traffic Laboratory Laborc U. 1. Budapest, H ...;Ericsson Traffic Laboratory Laborc U. 1. Budapest, Hungary H-1037
Venue:
Journal of Graph Theory
Year:
2002

Citing 0
Cited 4

On the maximum even factor in weakly symmetric graphs

Journal of Combinatorial Theory Series B
The independent even factor problem

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A combinatorial algorithm to find a maximum even factor

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Facets of the independent path-matching polytope

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

As a common generalization of matchings and matroidintersections, W.H. Cunningham and J.F. Geelen introduced thenotion of path-matchings. They proved a min-max formula for themaximum value. Here, we exhibit a simplified version of theirmin-max theorem and provide a purely combinatorial proof. ©2002 Wiley Periodicals, Inc. J Graph Theory 41: 110119, 2002András Frank and László Szegõ, arethe members of the Egerváry Research Group (EGRES).