Fractional matchings and covers in infinite hypergraphs

DOI10.1007/BF02579360zbMath0664.05045MaRDI QIDQ1115456

Ron Aharoni

Publication date: 1985

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

hypergraphsmatchingsfractional coverscountable graphscountable hypergraphs

Mathematics Subject Classification ID

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

Related Items

Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance ⋮ Maximal irredundant functions ⋮ Optimal fractional matchings and covers in infinite hypergraphs: existence and duality ⋮ Matchings and covers in hypergraphs ⋮ On the computational complexity of upper fractional domination ⋮ LP duality in infinite hypergraphs

Cites Work

• Injective choice functions for countable families
• 2-Matchings and 2-covers of hypergraphs