Large sets of t-designs through partitionable sets: a survey

DOI10.1016/J.DISC.2004.07.043zbMATH Open1107.05013OpenAlexW2051426330MaRDI QIDQ856838FDOQ856838

Authors: 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

Recommendations

• Extending large sets of \(t\)-designs
• On the existence of large sets of \(t\)-designs of prime sizes.
• New large sets of \(t\)-designs
• Root cases of large sets of \(t\)-designs
• Large sets of \(t\)-designs from \(t\)-homogeneous groups.

zbMATH Keywords

recursive constructions

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Cites Work

• A course in combinatorics.
• Extending t-designs
• Title not available (Why is that?)
• Title not available (Why is that?)
• t-designs on hypergraphs
• Some infinite families of large sets of \(t\)-designs
• New large sets of \(t\)-designs
• Title not available (Why is that?)
• A few more large sets oft-designs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
• On large sets of disjoint Steiner triple systems. IV
• Locally trivial t-designs and t-designs without repeated blocks
• Partitions of the 4-subsets of a 13-set into disjoint projective planes
• Some balanced complete block designs
• All block designs with \(b={v\choose k}/2\) exist
• On the maximum number of disjoint triple systems
• Covering all triples on n marks by disjoint Steiner systems
• Title not available (Why is that?)
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• Title not available (Why is that?)
• On t-Designs and Groups
• More on halving the complete designs
• Extending large sets of \(t\)-designs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 3-designs with block size 6 from \(\mathrm{PSL}(2,q)\) and their large sets
• Towards a Large Set of Steiner Quadruple Systems
• The existence of simple \(6\text{-}(14,7,4)\) designs
• Semiregular large sets
• Root cases of large sets of \(t\)-designs
• On the existence of large sets of \(t\)-designs of prime sizes.
• 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
• Backtracking algorithm for finding t‐designs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (16)

• Title not available (Why is that?)
• Design systems: Combinatorial characterizations of Delsarte \(I\)-designs via partially ordered sets
• Some infinite families of \(t\)-regular self-complementary \(k\)-hypergraphs
• Extremal properties of \(t\)-SEEDs and recursive constructions
• Some new families of 3-regular self-complementary \(k\)-hypergraphs
• On the large sets of \(t\)-designs of size nine
• Large sets of t-designs from groups
• Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
• 3-spontaneous emission error designs from \(\mathrm{PSL}(2,q)\) or \(\mathrm{PGL}(2,q)\)
• Title not available (Why is that?)
• Partitionable sets, almost partitionable sets, and their applications
• What is a design? how should we classify them?
• Title not available (Why is that?)
• 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

Uses Software

• DISCRETA

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)