Pages that link to "Item:Q2431267"

The following pages link to Unifying some known infinite families of combinatorial 3-designs (Q2431267):

Displaying 11 items.

• Construction of 3-designs using \((1,\sigma)\)-resolution (Q326330) (← links)
• A new result on Sylvester's problem (Q397135) (← links)
• Simple \(t\)-designs: a recursive construction for arbitrary \(t\) (Q521850) (← links)
• On simple 3-designs having 2-resolutions (Q776286) (← links)
• Infinite families of 3-designs from o-polynomials (Q825921) (← links)
• New infinite families of 3-designs from algebraic curves of higher genus over finite fields (Q1010599) (← links)
• A recursive construction for simple \(t\)-designs using resolutions (Q1752538) (← links)
• Resolvability of infinite designs (Q2434885) (← links)
• A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs (Q2449136) (← links)
• A construction for infinite families of Steiner 3-designs (Q5937129) (← links)
• Point-missing \(s\)-resolvable \(t\)-designs: infinite series of 4-designs with constant index (Q6101277) (← links)