Large sets of t-designs through partitionable sets: a survey
From MaRDI portal
(Redirected from Publication:856838)
Large sets of \(t\)-designs through partitionable sets: a survey
Large sets of \(t\)-designs through partitionable sets: a survey
Recommendations
Cites work
- scientific article; zbMATH DE number 3882436 (Why is no real title available?)
- scientific article; zbMATH DE number 4047735 (Why is no real title available?)
- scientific article; zbMATH DE number 68916 (Why is no real title available?)
- scientific article; zbMATH DE number 91054 (Why is no real title available?)
- scientific article; zbMATH DE number 124524 (Why is no real title available?)
- scientific article; zbMATH DE number 3478938 (Why is no real title available?)
- scientific article; zbMATH DE number 3520420 (Why is no real title available?)
- scientific article; zbMATH DE number 1343067 (Why is no real title available?)
- scientific article; zbMATH DE number 1011078 (Why is no real title available?)
- scientific article; zbMATH DE number 827991 (Why is no real title available?)
- scientific article; zbMATH DE number 874485 (Why is no real title available?)
- scientific article; zbMATH DE number 238435 (Why is no real title available?)
- 3-designs with block size 6 from \(\mathrm{PSL}(2,q)\) and their large sets
- A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
- A course in combinatorics.
- A few more large sets oft-designs
- All block designs with \(b={v\choose k}/2\) exist
- Backtracking algorithm for finding t‐designs
- Covering all triples on n marks by disjoint Steiner systems
- Extending large sets of t-designs
- Extending t-designs
- 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
- Large sets of 3‐designs from psl(2, q), with block sizes 4 and 5
- Locally trivial t-designs and t-designs without repeated blocks
- More on halving the complete designs
- New large sets of \(t\)-designs
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- On large sets of disjoint Steiner triple systems. IV
- On t-Designs and Groups
- On the existence of large sets of \(t\)-designs of prime sizes.
- On the maximum number of disjoint triple systems
- Partitions of the 4-subsets of a 13-set into disjoint projective planes
- Root cases of large sets of \(t\)-designs
- Semiregular large sets
- Some balanced complete block designs
- Some infinite families of large sets of \(t\)-designs
- The existence of simple \(6\text{-}(14,7,4)\) designs
- Towards a Large Set of Steiner Quadruple Systems
- t-designs on hypergraphs
Cited in
(16)- Design systems: Combinatorial characterizations of Delsarte \(I\)-designs via partially ordered sets
- scientific article; zbMATH DE number 1343067 (Why is no real title available?)
- Extremal properties of \(t\)-SEEDs and recursive constructions
- Some infinite families of \(t\)-regular self-complementary \(k\)-hypergraphs
- Some new families of 3-regular self-complementary \(k\)-hypergraphs
- On the large sets of t-designs of size nine
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- Large sets of t-designs from groups
- 3-spontaneous emission error designs from \(\mathrm{PSL}(2,q)\) or \(\mathrm{PGL}(2,q)\)
- scientific article; zbMATH DE number 4132166 (Why is no real title available?)
- Partitionable sets, almost partitionable sets, and their applications
- What is a design? how should we classify them?
- scientific article; zbMATH DE number 637294 (Why is no real title available?)
- Bounds and constructions of \(t\)-spontaneous emission error designs
- New large sets of resolvable Mendelsohn triple systems
- A recursive construction for simple \(t\)-designs using resolutions
This page was built for publication: Large sets of \(t\)-designs through partitionable sets: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856838)
