Asymptotically maximal packing of k-sets without double covered pairs

zbMATH Open1289.05372MaRDI QIDQ2859458FDOQ2859458

Authors: Péter M. Gergely 

Publication date: 7 November 2013

Published in: Matematikai Lapok. (New Series) (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4104975
• Covering and packing for pairs
• On a packing and covering problem
• On the difference between asymptotically good packings and coverings
• Packing of partial designs

zbMATH Keywords

asymptotically maximal propertynesting packingspacking the Turán graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (4)

• Title not available (Why is that?)
• Weakly union-free maximum packings
• Packing cliques in 3‐uniform hypergraphs
• On the difference between asymptotically good packings and coverings

This page was built for publication: Asymptotically maximal packing of \(k\)-sets without double covered pairs

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