Packing of partial designs

DOI10.1007/BF01202465zbMath0797.05008OpenAlexW2022127754MaRDI QIDQ1323485

Noga Alon

Publication date: 10 October 1994

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01202465

zbMATH Keywords

packinghypergraphspartial designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Extremal set theory (05D05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge disjoint placement of graphs
• On a packing and covering problem
• Packings of graphs and applications to computational complexity
• On making two Steiner triple systems disjoint
• Subgraphs of graphs. I
• A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
• Constructions of Disjoint Steiner Triple Systems

This page was built for publication: Packing of partial designs