A generalisation of \(t\)-designs
From MaRDI portal
Publication:1044956
DOI10.1016/j.disc.2008.07.005zbMath1186.05024OpenAlexW2112816145MaRDI QIDQ1044956
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.07.005
Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Triple systems (05B07)
Related Items (12)
Generating Uniformly Distributed Random 2-Designs with Block Size 3 ⋮ On generalized Howell designs with block size three ⋮ Information dimension of stochastic processes on networks: relating entropy production to spectral properties ⋮ Generalized packing designs ⋮ A generalization of group divisible t $t$‐designs ⋮ Jacobi polynomials and design theory. II ⋮ Inclusion matrices for rainbow subsets ⋮ Jacobi polynomials and design theory I ⋮ Almost all Steiner triple systems are almost resolvable ⋮ On generalised \(t\)-designs and their parameters ⋮ Generalized covering designs and clique coverings ⋮ An upper bound on the number of Steiner triple systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Steiner triple systems with block-transitive automorphism groups
- Research problems from the 18th British Combinatorial Conference
- Locally trivial t-designs and t-designs without repeated blocks
- Embeddings of Steiner triple systems
- Nonisomorphic Steiner triple systems
- Almost All Steiner Triple Systems Are Asymmetric
- Generating uniformly distributed random latin squares
- The use of hill‐climbing to construct orthogonal steiner triple systems
- On permanents of random doubly stochastic matrices and asymptotic estimates of the nom hers of Latin rectangles and Latin squares
- Embedding partial Steiner triple systems so that their automorphisms extend
- A Combinatorial Theorem with an Application to Latin Rectangles
This page was built for publication: A generalisation of \(t\)-designs
