Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
From MaRDI portal
Publication:579265
DOI10.1016/0012-365X(87)90061-6zbMath0625.05005MaRDI QIDQ579265
Publication date: 1987
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ A method of constructing 2-resolvable \(t\)-designs for \(t=3,4\) ⋮ Large sets of \(t\)-designs over finite fields exist for all \(t\) ⋮ Large sets of \(t\)-designs through partitionable sets: a survey ⋮ On balanced incomplete-block designs with repeated blocks ⋮ Block transitive resolutions of \(t\)-designs and Room rectangles ⋮ Probabilistic existence of regular combinatorial structures ⋮ An extending theorem for \(s\)-resolvable \(t\)-designs ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Nontrivial \(t\)-designs over finite fields exist for all \(t\) ⋮ Point-missing \(s\)-resolvable \(t\)-designs: infinite series of 4-designs with constant index ⋮ Probabilistic existence of large sets of designs ⋮ Graph and hypergraph packing ⋮ EXISTENCE OF -ANALOGS OF STEINER SYSTEMS ⋮ On completely regular codes ⋮ Classification of partitions of all triples on ten points into copies of Fano and affine planes ⋮ Designs in a coset geometry: Delsarte theory revisited. ⋮ Intersecting designs ⋮ Coloured and Directed Designs ⋮ Codes and designs -- existence and uniqueness ⋮ A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes ⋮ Large sets of subspace designs ⋮ 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)\) ⋮ Conformal designs based on vertex operator algebras ⋮ A recursive construction for simple \(t\)-designs using resolutions ⋮ Simple \(t\)-designs: a recursive construction for arbitrary \(t\) ⋮ Vertex-transitive self-complementary uniform hypergraphs of prime order ⋮ A prospect for a general method of constructing \(t\)-designs ⋮ Unnamed Item ⋮ Derived and residual subspace designs ⋮ Large sets with multiplicity ⋮ The family of block designs with some combinatorial properties ⋮ Orthogonal decomposition and packing of complete graphs ⋮ Designs in finite metric spaces: a probabilistic approach ⋮ Locally trivial t-designs and t-designs without repeated blocks ⋮ Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I ⋮ Optimization, block designs and no free lunch theorems ⋮ New \(t\)-designs and large sets of \(t\)-designs ⋮ Hamiltonicity and restricted block-intersection graphs of \(t\)-designs ⋮ Recursive constructions for \(s\)-resolvable \(t\)-designs ⋮ Simple non-trivial designs with an arbitrary automorphism group
Cites Work
