On the difference between asymptotically good packings and coverings

DOI10.1016/0195-6698(95)90087-XzbMath0819.05020WikidataQ105583540 ScholiaQ105583540MaRDI QIDQ1345524

Nikolaj Nikolaevich Kuzyurin

Publication date: 8 March 1995

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

packingscoverings

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Related Items (10)

New lower bounds for van der Waerden numbers ⋮ Independence numbers of Johnson-type graphs ⋮ New bounds on the size of nearly perfect matchings in almost regular hypergraphs ⋮ 2-colorings of hypergraphs with large girth ⋮ A note on supersaturated set systems ⋮ General theory of information transfer: Updated ⋮ New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help ⋮ Note on asymptotically good packings ⋮ Constructions of sparse uniform hypergraphs with high chromatic number ⋮ On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces

Cites Work

• Some simple consequences of coding theory for combinatorial problems of packings and coverings
• On a packing and covering problem
• Asymptotically good coverings
• Primes in short intervals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the difference between asymptotically good packings and coverings