A NOTE ON PARITY CONSTRAINED ORIENTATIONS
WoS ID: 000271903200006
Scopus ID: 77956009209
This note extends a result of Frank, Jordan, and Szigeti  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.