New \(t\)-designs and large sets of \(t\)-designs
From MaRDI portal
Publication:1292816
DOI10.1016/S0012-365X(99)90047-XzbMath0936.05010OpenAlexW4213006630MaRDI QIDQ1292816
Alfred Wassermann, Anton Betten, Reinhard Laue
Publication date: 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90047-x
Related Items (3)
Hypergraphical \(t\)-designs ⋮ \(t\)-wise balanced designs ⋮ Search for combinatorial objects using lattice algorithms -- revisited
Uses Software
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
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- On the construction of \(t\)-designs and the existence of some new infinite families of simple 5-designs
- The existence of simple \(6\text{-}(14,7,4)\) designs
- Factoring polynomials with rational coefficients
- Combining \(t\)-designs
- Extending t-designs
- On t-designs
- t-designs on hypergraphs
- Simple \(8\)-designs with small parameters
- Simple 8-(40, 11, 1440) designs
- High order intersection numbers of \(t\)-designs
- Locally trivial t-designs and t-designs without repeated blocks
- Allgemeine Schnittzahlen in t-Designs. (General intersection numbers in t-designs)
- Extending large sets of \(t\)-designs
- The t‐designs with prescribed automorphism group, new simple 6‐designs
This page was built for publication: New \(t\)-designs and large sets of \(t\)-designs