Large sets of \(t\)-designs through partitionable sets: a survey

DOI10.1016/j.disc.2004.07.043zbMath1107.05013OpenAlexW2051426330MaRDI QIDQ856838

B. Tayfeh-Rezaie, Gholamreza Khosrovshahi

Publication date: 14 December 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.07.043

zbMATH Keywords

recursive constructions

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Related Items

On the large sets of \(t\)-designs of size nine ⋮ What is a design? how should we classify them? ⋮ Some new families of 3-regular self-complementary \(k\)-hypergraphs ⋮ Bounds and constructions of \(t\)-spontaneous emission error designs ⋮ Extremal properties of \(t\)-SEEDs and recursive constructions ⋮ Probabilistic existence of large sets of designs ⋮ New large sets of resolvable Mendelsohn triple systems ⋮ Some infinite families of \(t\)-regular self-complementary \(k\)-hypergraphs ⋮ A recursive construction for simple \(t\)-designs using resolutions ⋮ Hamiltonian decompositions of complete \(k\)-uniform hypergraphs ⋮ 3-Spontaneous Emission Error Designs from PSL(2, q)or PGL(2, q)

Uses Software

• DISCRETA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• On large sets of disjoint Steiner triple systems. IV
• 3-designs with block size 6 from \(\mathrm{PSL}(2,q)\) and their large sets
• The existence of simple \(6\text{-}(14,7,4)\) designs
• A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
• Some balanced complete block designs
• Extending t-designs
• t-designs on hypergraphs
• Some infinite families of large sets of \(t\)-designs
• More on halving the complete designs
• All block designs with \(b={v\choose k}/2\) exist
• Semiregular large sets
• Locally trivial t-designs and t-designs without repeated blocks
• Partitions of the 4-subsets of a 13-set into disjoint projective planes
• On the maximum number of disjoint triple systems
• Root cases of large sets of \(t\)-designs
• Extending large sets of \(t\)-designs
• Covering all triples on n marks by disjoint Steiner systems
• On the existence of large sets of \(t\)-designs of prime sizes.
• Towards a Large Set of Steiner Quadruple Systems
• Infinite families of 2- and 3-designs with parameters v = p + 1, k = (p ? 1)/2i + 1, where p odd prime, 2e T (p ? 1), e ? 2, 1 ? i ? e
• A few more large sets oft-designs
• Large sets of 3‐designs from psl(2, q), with block sizes 4 and 5
• Backtracking algorithm for finding t‐designs
• On t-Designs and Groups