Asymptotically good coverings

DOI10.2140/pjm.1985.118.575zbMath0578.05010OpenAlexW2037072835MaRDI QIDQ1066148

J. H. Spencer

Publication date: 1985

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.pjm/1102706462

zbMATH Keywords

coveringErdős-Hanani conjecture

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial aspects of packing and covering (05B40)

Related Items

On the difference between asymptotically good packings and coverings, Fractional v. integral covers in hypergraphs of bounded edge size, Near-optimal distributed edge coloring, Matchings and covers in hypergraphs, Near-optimal, distributed edge colouring via the nibble method, Generalized covering designs and clique coverings, Boolean function minimization in the class of disjunctive normal forms, Asymptotic behavior of the chromatic index for hypergraphs