scientific article; zbMATH DE number 4104975

MaRDI QIDQ3829565zbMATH OpenFDO

Authors Peter Frankl, Zoltán Füredi

Publication date 1987

zbMATH Keywords

family of setshypergraphpackingSteiner-system

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of packing and covering (05B40) Hypergraphs (05C65)

Recommendations

• Asymptotically maximal packing of k-sets without double covered pairs
• Packing of partial designs
• scientific article; zbMATH DE number 15160
• More-than-nearly-perfect packings and partial designs
• scientific article; zbMATH DE number 637348

Cited in

(16)

• Packing of partial designs
• On the upper bound of the size of the \(r\)-cover-free families
• Matchings and covers in hypergraphs
• Degenerate Turán densities of sparse hypergraphs
• On a hypergraph matching problem
• Asymptotically maximal packing of k-sets without double covered pairs
• Induced decompositions of highly dense graphs
• On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
• Note on asymptotically good packings
• New Turán Exponents for Two Extremal Hypergraph Problems
• Hypergraphs not containing a tight tree with a bounded trunk
• scientific article; zbMATH DE number 6257577 (Why is no real title available?)
• Packing cliques in 3‐uniform hypergraphs
• Constructions of optimal sparse r-disjunct matrices via packings
• Focal-free uniform hypergraphs and codes
• Counting cliques with prescribed intersection sizes

This page was built for publication:

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