Intersecting designs

DOI10.1006/jcta.1999.3039zbMath0954.05008OpenAlexW4213183739MaRDI QIDQ1971015

Raphael Yuster, Yair Caro

Publication date: 5 February 2001

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1b1ef7a528c5a0b5c29e5973088ca6caa27982d9

zbMATH Keywords

decompositions\(t\)-designintersection conjecture for designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Large forbidden trade volumes and edge packings of random graphs

Cites Work

• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• On large sets of disjoint Steiner triple systems. VI
• Steiner quadruple systems having a prescribed number of quadruples in common
• Construction of Steiner quadruple systems having a prescribed number of blocks in common
• A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
• Intersections of Steiner quadruple systems
• The intersection problem for \(K_4-e\) designs
• The intersection problem for star designs
• Packing graphs: The packing problem solved
• Orthogonal decomposition and packing of complete graphs
• Intersections among Steiner systems
• Intersection Properties of Steiner Systems
• Steiner Triple Systems Having a Prescribed Number of Triples in Common
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Intersecting designs