×

Solution of two fractional packing problems of Lovász. (English) Zbl 0413.05044


MSC:

05C65 Hypergraphs
90C10 Integer programming
90C05 Linear programming
05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Citations:

Zbl 0358.90046
Full Text: DOI

References:

[1] Berge, C., Balanced hypergraphs and some applications to graph theory, (Srivastava, J. N., A Survey of Combinatorial Theory (1973), North-Holland: North-Holland Amsterdam), 15-23 · Zbl 0264.05114
[2] Edmonds, J.; Giles, R., A min-max relation for submodular functions on graphs, Ann. Discrete Math., 1, 185-204 (1977) · Zbl 0373.05040
[3] Lovász, L., Normal hypergraphs and the perfect graph conjecture, Discrete Math., 2, 253-267 (1972) · Zbl 0239.05111
[4] Lovász, L., Minimax theorems for hypergraphs, (Hypergraph Seminar. Hypergraph Seminar, Lecture Notes in Math., 411 (1974), Springer: Springer Berlin), 111-126 · Zbl 0305.05129
[5] Lovász, L., 2-matchings and 2-covers of hypergraphs, Acta Math. Acad. Sci. Hungar., 26, 433-444 (1975) · Zbl 0339.05123
[6] Lovász, L., On two minimax theorems in graph theory, J. Combin. Theory, 21, B, 96-103 (1976) · Zbl 0337.05115
[7] Lovász, L., Certain duality principles in integer programming, Ann. Discrete Math., 1, 363-374 (1977) · Zbl 0358.90046
[8] P.D. Seymour, On multicolourings of cubic graphs, and conjectures of Fulkerson and Tutte, Proc. London Math. Soc., to appear.; P.D. Seymour, On multicolourings of cubic graphs, and conjectures of Fulkerson and Tutte, Proc. London Math. Soc., to appear. · Zbl 0411.05037
[9] Seymour, P. D., The matroids with the max-flow min-cut property, J. Combin. Theory, 23, B, 189-222 (1977) · Zbl 0375.05022
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.