Bounds for optimal coverings

DOI10.1016/S0166-218X(03)00372-XzbMath1043.05085OpenAlexW2021732011MaRDI QIDQ1827869

Yoshiharu Kohayakawa, Carlos Gustavo T.de A. Moreira

Publication date: 6 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00372-x

zbMATH Keywords

hypergraphscoveringsprobabilistic methodset systems

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• On a packing and covering problem
• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• Matchings and covers in hypergraphs
• Transversal numbers of uniform hypergraphs
• Two combinatorial covering theorems
• On the lottery problem
• Football Pools--A Game for Mathematicians