Pages that link to "Item:Q856838"

The following pages link to Large sets of \(t\)-designs through partitionable sets: a survey (Q856838):

Displaying 11 items.

• On the large sets of \(t\)-designs of size nine (Q277463) (← links)
• Extremal properties of \(t\)-SEEDs and recursive constructions (Q404934) (← links)
• Hamiltonian decompositions of complete \(k\)-uniform hypergraphs (Q712220) (← links)
• Some infinite families of \(t\)-regular self-complementary \(k\)-hypergraphs (Q1734052) (← links)
• A recursive construction for simple \(t\)-designs using resolutions (Q1752538) (← links)
• Some new families of 3-regular self-complementary \(k\)-hypergraphs (Q2152951) (← links)
• Probabilistic existence of large sets of designs (Q2194761) (← links)
• What is a design? how should we classify them? (Q2384043) (← links)
• Bounds and constructions of \(t\)-spontaneous emission error designs (Q2407712) (← links)
• New large sets of resolvable Mendelsohn triple systems (Q2449174) (← links)
• 3-Spontaneous Emission Error Designs from PSL<b>(2, q)</b>or PGL<b>(2, q)</b> (Q2812296) (← links)