The following pages link to (Q2708218):
Displaying 15 items.
- Large sets of \(t\)-designs through partitionable sets: a survey (Q856838) (← links)
- 3-designs from \(\text{PSL}(2,q)\) (Q856851) (← links)
- 3-designs with block size 6 from \(\mathrm{PSL}(2,q)\) and their large sets (Q879333) (← links)
- Some infinite families of large sets of \(t\)-designs (Q1296761) (← links)
- A recursive construction for simple \(t\)-designs using resolutions (Q1752538) (← links)
- Search for combinatorial objects using lattice algorithms -- revisited (Q2115837) (← links)
- A method of constructing 2-resolvable \(t\)-designs for \(t=3,4\) (Q2153749) (← links)
- Recursive constructions for \(s\)-resolvable \(t\)-designs (Q2334440) (← links)
- Large sets of \(t\)-designs over finite fields (Q2439574) (← links)
- An extending theorem for \(s\)-resolvable \(t\)-designs (Q2657143) (← links)
- 3-Spontaneous Emission Error Designs from PSL<b>(2, q)</b>or PGL<b>(2, q)</b> (Q2812296) (← links)
- New large sets of t-designs from t-homogeneous groups (Q4577858) (← links)
- (Q5135775) (← links)
- (Q5241126) (← links)
- On the number of mutually disjoint cyclic designs and large sets of designs (Q5935433) (← links)
