On the maximum even factor in weakly symmetric graphs

Authors:
Gyula Pap;László Szegö
Affiliations:
Department of Operations Research, Eötvös University, Pázmány Péter sétány 1/C, H-1117 Budapest, Hungary;Department of Operations Research, Eötvös University, Pázmány Péter sétány 1/C, H-1117 Budapest, Hungary
Venue:
Journal of Combinatorial Theory Series B
Year:
2004

Citing 4
Cited 3

Orthogonal structures in directed graphs

Journal of Combinatorial Theory Series B
The optimal path-matching problem

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Note on the path-matching formula

Journal of Graph Theory
A Gallai–Edmonds-type structure theorem for path-matchings

Journal of Graph Theory

The independent even factor problem

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Even factors, jump systems, and discrete convexity

Journal of Combinatorial Theory Series B
A combinatorial algorithm to find a maximum even factor

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

As a common generalization of matchings and matroid intersection, Cunningham and Geelen introduced the notion of path-matchings, then they introduced the more general notion of even factor in weakly symmetric digraphs. Here we give a min-max formula for the maximum cardinality of an even factor. Our proof is purely combinatorial. We also provide a Gallai-Edmonds-type structure theorem for even factors.