Király, Tamás and Szabó, Jácint (2003) A note on parity constrained orientations. Technical Reports. ISSN 1587-4451
|
Text
egres_03_11_u_164530.245915.pdf Download (232kB) | Preview |
Abstract
This note extends the results of Frank, Jordán, 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. It is shown that the minimum number of nodes with wrong in-degree parity in a strongly connected orientation cannot be characterized by a similar formula.
| Item Type: | Article |
|---|---|
| Additional Information: | Published in: COMBINATORICA (Springer, ISSN 0209-9683) 29. évfolyam (2009), 5. szám, p. 619-628. DOI:10.1007/s00493-009-2411-8 |
| Uncontrolled Keywords: | GRAPHS |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 16 Dec 2014 07:58 |
| Last Modified: | 16 Dec 2014 08:34 |
| URI: | http://real.mtak.hu/id/eprint/19436 |
Actions (login required)
 |
Edit Item |
