Optimal fractional matchings and covers in infinite hypergraphs: existence and duality

DOI10.1007/BF01271704zbMath0771.05077OpenAlexW1980783182MaRDI QIDQ1187944

Ron Holzman, Ron Aharoni

Publication date: 3 August 1992

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01271704

zbMATH Keywords

linear programmingdualityfractional coversfractional matchingsinfinite hypergraphs

Mathematics Subject Classification ID

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

Related Items (2)

Infinite matching theory ⋮ On packing and covering polyhedra in infinite dimensions

Cites Work

• LP duality in infinite hypergraphs
• Fractional matchings and covers in infinite hypergraphs
• 2-Matchings and 2-covers of hypergraphs

This page was built for publication: Optimal fractional matchings and covers in infinite hypergraphs: existence and duality