On the difference between asymptotically good packings and coverings
From MaRDI portal
Publication:1345524
DOI10.1016/0195-6698(95)90087-XzbMath0819.05020WikidataQ105583540 ScholiaQ105583540MaRDI QIDQ1345524
Publication date: 8 March 1995
Published in: European Journal of Combinatorics (Search for Journal in Brave)
05B40: Combinatorial aspects of packing and covering
Related Items
New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help, 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, A note on supersaturated set systems, On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces, General theory of information transfer: Updated, 2-colorings of hypergraphs with large girth, Constructions of sparse uniform hypergraphs with high chromatic number, Note on asymptotically good packings
Cites Work