Pages that link to "Item:Q579265"

The following pages link to Non-trivial \(t\)-designs without repeated blocks exist for all \(t\) (Q579265):

Displaying 42 items.

• Nontrivial \(t\)-designs over finite fields exist for all \(t\) (Q406567) (← links)
• A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes (Q492219) (← links)
• Large sets of subspace designs (Q501693) (← links)
• Simple \(t\)-designs: a recursive construction for arbitrary \(t\) (Q521850) (← links)
• Large sets of \(t\)-designs through partitionable sets: a survey (Q856838) (← links)
• Classification of partitions of all triples on ten points into copies of Fano and affine planes (Q924963) (← links)
• Vertex-transitive self-complementary uniform hypergraphs of prime order (Q965936) (← links)
• Optimization, block designs and no free lunch theorems (Q1041724) (← links)
• Hamiltonicity and restricted block-intersection graphs of \(t\)-designs (Q1045028) (← links)
• Codes and designs -- existence and uniqueness (Q1182946) (← links)
• A prospect for a general method of constructing \(t\)-designs (Q1209147) (← links)
• New \(t\)-designs and large sets of \(t\)-designs (Q1292816) (← links)
• Block transitive resolutions of \(t\)-designs and Room rectangles (Q1361667) (← links)
• Designs in a coset geometry: Delsarte theory revisited. (Q1427972) (← links)
• A recursive construction for simple \(t\)-designs using resolutions (Q1752538) (← links)
• The family of block designs with some combinatorial properties (Q1802126) (← links)
• Orthogonal decomposition and packing of complete graphs (Q1806215) (← links)
• Locally trivial t-designs and t-designs without repeated blocks (Q1823945) (← links)
• Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I (Q1825881) (← links)
• Simple non-trivial designs with an arbitrary automorphism group (Q1865405) (← links)
• Intersecting designs (Q1971015) (← links)
• Derived and residual subspace designs (Q2018432) (← links)
• Large sets with multiplicity (Q2035460) (← links)
• Designs in finite metric spaces: a probabilistic approach (Q2051880) (← links)
• A method of constructing 2-resolvable \(t\)-designs for \(t=3,4\) (Q2153749) (← links)
• Large sets of \(t\)-designs over finite fields exist for all \(t\) (Q2153752) (← links)
• Probabilistic existence of large sets of designs (Q2194761) (← links)
• Recursive constructions for \(s\)-resolvable \(t\)-designs (Q2334440) (← links)
• Probabilistic existence of regular combinatorial structures (Q2400828) (← links)
• Simple \(8\)-\((31,12,3080)\), \(8\)-\((40,12,16200)\) and \(8\)-\((40,12,16520)\) designs from \(\mathrm{PSL}(3,5)\) and \(\mathrm{PSL}(4,3)\) (Q2467993) (← links)
• Conformal designs based on vertex operator algebras (Q2474323) (← links)
• On balanced incomplete-block designs with repeated blocks (Q2643844) (← links)
• An extending theorem for \(s\)-resolvable \(t\)-designs (Q2657143) (← links)
• EXISTENCE OF -ANALOGS OF STEINER SYSTEMS (Q2971026) (← links)
• Coloured and Directed Designs (Q3295270) (← links)
• (Q5076862) (← links)
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065) (← links)
• On completely regular codes (Q5970864) (← links)
• Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
• Point-missing \(s\)-resolvable \(t\)-designs: infinite series of 4-designs with constant index (Q6101277) (← links)
• Graph and hypergraph packing (Q6198635) (← links)
• Retracted article: ``Constructions for \(t\)-designs and \(s\)-resolvable \(t\)-designs'' (Q6632046) (← links)