Note on asymptotically good packings

DOI10.1002/JCD.20233MaRDI QIDQ3578141zbMATH OpenOpenAlexFDO

Authors Daniel Martin, Vojtěch Rödl

Publication date 13 July 2010

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jcd.20233

zbMATH Keywords

ErdősHananipackingSteiner system

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Steiner systems in finite geometry (51E10) Combinatorial codes (94B25)

Recommendations

• Nearly optimal partial Steiner systems
• On the independence number of Steiner systems
• More-than-nearly-perfect packings and partial designs
• scientific article; zbMATH DE number 4104975
• On (n, k, l, Δ)-systems

Cites work

• Asymptotic behavior of the chromatic index for hypergraphs
• Asymptotically optimal covering designs
• scientific article; zbMATH DE number 3841775 (Why is no real title available?)
• Near perfect coverings in graphs and hypergraphs
• Nearly perfect matchings in regular simple hypergraphs
• New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
• On a packing and covering problem
• On the difference between asymptotically good packings and coverings
• On the difference between consecutive primes

Cited in

(4)

• Ranks of matrices with few distinct entries
• Block avoiding point sequencings of partial Steiner systems
• Nearly optimal partial Steiner systems
• The number of partial Steiner systems and d-partitions

This page was built for publication: Note on asymptotically good packings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578141)