The following pages link to (Q3784080):
Displaying 23 items.
- The existence of quasi regular and bi-regular self-complementary 3-uniform hypergraphs (Q274699) (← links)
- Extremal properties of \(t\)-SEEDs and recursive constructions (Q404934) (← links)
- More on the Wilson \(W_{tk}(v)\) matrices (Q405268) (← links)
- On the inclusion matrix \(W_{23}(v)\) (Q406474) (← links)
- Large sets of subspace designs (Q501693) (← links)
- Almost self-complementary 3-uniform hypergraphs (Q503672) (← links)
- Halving Steiner triple systems (Q686282) (← links)
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs (Q712220) (← links)
- Large sets of \(t\)-designs through partitionable sets: a survey (Q856838) (← links)
- A prospect for a general method of constructing \(t\)-designs (Q1209147) (← links)
- Partitioning sets of quadruples into designs. I (Q1263589) (← links)
- Some infinite families of large sets of \(t\)-designs (Q1296761) (← links)
- More on halving the complete designs (Q1343246) (← links)
- All block designs with \(b={v\choose k}/2\) exist (Q1377704) (← links)
- A recursive construction for simple \(t\)-designs using resolutions (Q1752538) (← links)
- New partitionings of complete designs (Q2243891) (← links)
- On the volumes and affine types of trades (Q2290357) (← links)
- Recursive constructions for \(s\)-resolvable \(t\)-designs (Q2334440) (← links)
- The kernels of the incidence matrices of graphs revisited (Q2369059) (← links)
- Constructing regular self-complementary uniform hypergraphs (Q2896012) (← links)
- Zero-sum flows in designs (Q3100730) (← links)
- (Q4266927) (← links)
- Inclusion matrices for rainbow subsets (Q6185748) (← links)
