Abstract
This note extends a result of Frank, Jordán, and Szigeti [3] on parity constrained orientations with connectivity requirements. Given a hypergraph H, a non-negative intersecting supermodular set function p, and a preferred in-degree parity for every node, a formula is given on the minimum number of nodes with wrong in-degree parity in an orientation of H covering p.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. Berge: Sur le couplage maximum d’un graphe, C. R. Acad. Sci. Paris 247 (1958), 258–259.
A. Frank: On the orientation of graphs, J. Combin. Theory B28 (1980), 251–261.
A. Frank, T. Jordán and Z. Szigeti: An orientation theorem with parity conditions, Discrete Applied Mathematics115 (2001), 37–45.
A. Frank, T. Király and Z. Király: On the orientation of graphs and hypergraphs, Discrete Applied Mathematics131(2) (2003), 385–400.
A. Frank, A. Sebő and É. Tardos: Covering directed and odd cuts, Mathematical Programming Study22 (1984), 99–112.
M. Makai: Parity problems of combinatorial polymatroids, PhD thesis, Eötvös University, Budapest, (2007).
M. Makai and J. Szabó: The parity problem of polymatroids without double circuits, EGRES Technical ReportTR-2006-08, www.cs.elte.hu/egres.
L. Nebeský: A new characterization of the maximum genus of a graph, Czechoslovak Math. J. 31(106) (1981), 604–613.
Gy. Pap: A constructive approach to matching and its generalizations, PhD thesis, Eötvös University, Budapest, (2006).
Author information
Authors and Affiliations
Corresponding author
Additional information
Research is supported by OTKA grants K60802, TS049788 and by European MCRTN Adonet, Contract Grant No. 504438.