scientific article; zbMATH DE number 4047735
From MaRDI portal
Publication:3784080
Recommendations
Cited in
(26)- A prospect for a general method of constructing \(t\)-designs
- Partitioning sets of quadruples into designs. I
- Some infinite families of large sets of \(t\)-designs
- More on halving the complete designs
- All block designs with \(b={v\choose k}/2\) exist
- A recursive construction for simple \(t\)-designs using resolutions
- New partitionings of complete designs
- On the volumes and affine types of trades
- Recursive constructions for s-resolvable t-designs
- The kernels of the incidence matrices of graphs revisited
- The existence of quasi regular and bi-regular self-complementary 3-uniform hypergraphs
- Constructing regular self-complementary uniform hypergraphs
- Zero-sum flows in designs
- Extremal properties of \(t\)-SEEDs and recursive constructions
- More on the Wilson \(W_{tk}(v)\) matrices
- On the inclusion matrix \(W_{23}(v)\)
- scientific article; zbMATH DE number 1343067 (Why is no real title available?)
- scientific article; zbMATH DE number 827991 (Why is no real title available?)
- Halving transversal designs
- Large sets of subspace designs
- Almost self-complementary 3-uniform hypergraphs
- Inclusion matrices for rainbow subsets
- Halving Steiner triple systems
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- Large sets of t-designs through partitionable sets: a survey
- Halving Steiner 2-designs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3784080)
