论文信息 - A note on parity constrained orientations

A note on parity constrained orientations

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.

Jácint Szabó | Tamás Király

[1] András Frank,et al. An Orientation Theorem with Parity Conditions , 1999, IPCO.

[2] András Frank,et al. On the orientation of graphs , 1980, J. Comb. Theory, Ser. B.

[3] Jácint Szabó,et al. The parity problem of polymatroids without double circuits , 2008, Comb..

[4] A. Frank,et al. Covering directed and odd cuts , 1984 .

[5] Ladislav Nebeský,et al. A new characterization of the maximum genus of a graph , 1981 .

[6] András Frank,et al. Egerváry Research Group on Combinatorial Optimization on the Orientation of Graphs and Hypergraphs on the Orientation of Graphs and Hypergraphs , 2022 .