On a theorem of Lovász on covers in \(r\)-partite hypergraphs

DOI10.1007/BF01844843zbMath0858.05083MaRDI QIDQ1924486

Michael Krivelevich, Ron Holzman, Ron Aharoni

Publication date: 11 March 1997

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

matchingcovershypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Transversal (matching) theory (05D15)

Related Items (10)

Hypergraph representation via axis-aligned point-subspace cover ⋮ Approximating vertex cover in dense hypergraphs ⋮ The feedback arc set problem with triangle inequality is a vertex cover problem ⋮ Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs ⋮ Independence-domination duality ⋮ On approximation of the vertex cover problem in hypergraphs ⋮ Approximating the discrete time-cost tradeoff problem with bounded depth ⋮ Approximating the discrete time-cost tradeoff problem with bounded depth ⋮ Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs ⋮ Approximation algorithms for hitting subgraphs

Cites Work

• Unnamed Item
• On the ratio of optimal integral and fractional covers
• Matchings and covers in hypergraphs
• Two combinatorial covering theorems
• Approximate Set Covering in Uniform Hypergraphs

This page was built for publication: On a theorem of Lovász on covers in \(r\)-partite hypergraphs