Large sets of \(t\)-designs through partitionable sets: a survey
type: Item
instance of: scholarly article
title: Large sets of \(t\)-designs through partitionable sets: a survey
zbMATH Open document ID: 1107.05013
author: B. Tayfeh-Rezaie
author: Gholamreza Khosrovshahi
published in: Discrete Mathematics
publication date: 2006-12-14T00:00:00Z
Mathematics Subject Classification ID: 05B05
zbMATH DE Number: 5080042
zbMATH Keywords: recursive constructions
describes a project that uses: DISCRETA
MaRDI profile type: Publication
full work available at URL: j.disc.2004.07.043
OpenAlex ID: W2051426330
cites work: Extending large sets of \(t\)-designs
cites work: Q4337360
cites work: All block designs with \(b={v\choose k}/2\) exist
cites work: More on halving the complete designs
cites work: Q4858957
cites work: Extending t-designs
cites work: Q4063504
cites work: Q4100097
cites work: Q4014625
cites work: A few more large sets oft-designs
cites work: Partitions of the 4-subsets of a 13-set into disjoint projective planes
cites work: Large sets of 3‐designs from psl(2, q), with block sizes 4 and 5
cites work: Semiregular large sets
cites work: Towards a Large Set of Steiner Quadruple Systems
cites work: Q3784080
cites work: On t-Designs and Groups
cites work: 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
cites work: Root cases of large sets of \(t\)-designs
cites work: Q5287875
cites work: Q4017200
cites work: t-designs on hypergraphs
cites work: Q4876923
cites work: The existence of simple \(6\text{-}(14,7,4)\) designs
cites work: Q4266927
cites work: New large sets of \(t\)-designs
cites work: On large sets of disjoint Steiner triple systems. IV
cites work: Backtracking algorithm for finding t‐designs
cites work: 3-designs with block size 6 from \(\mathrm{PSL}(2,q)\) and their large sets
cites work: Covering all triples on n marks by disjoint Steiner systems
cites work: Some balanced complete block designs
cites work: Some infinite families of large sets of \(t\)-designs
cites work: On the existence of large sets of \(t\)-designs of prime sizes.
cites work: On the maximum number of disjoint triple systems
cites work: Q3216658
cites work: Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
cites work: Locally trivial t-designs and t-designs without repeated blocks
cites work: A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
cites work: Q4026154
cites work: A course in combinatorics.
DOI: 10.1016/J.DISC.2004.07.043
description: scientific article; zbMATH DE number 5080042