A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
From MaRDI portal
Publication:1175958
DOI10.1016/0097-3165(91)90053-JzbMath0742.05016MaRDI QIDQ1175958
Publication date: 25 June 1992
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Related Items
Construction of Uniform Designs and Complex-Structured Uniform Designs via Partitionable t-Designss, New results on LR-designs and OLKTSs, New results on large sets of Kirkman triple systems, Constructions for large sets of \(L\)-intersecting Steiner triple systems, Large sets of \(t\)-designs through partitionable sets: a survey, Large sets of three types of oriented triple systems, Partitions of sets of two-fold triple systems, and their relations to some strongly regular graphs, Large sets and overlarge sets of triangle-decomposition, On large sets of directed triple systems, Bounds and constructions of \(t\)-spontaneous emission error designs, Efficient two-stage group testing algorithms for genetic screening, On the chromatic number, colorings, and codes of the Johnson graph, Covering 2-paths uniformly, Token graphs, 2-\((v,5;m)\) spontaneous emission error designs, Indecomposable large sets of Steiner triple systems with indices 5, 6, Constructions for large sets of \(v-1\{0,{v\over 3}\}\)-intersecting Steiner triple systems of order \(v\), Existence of frame-derived H-designs, A new result on Sylvester's problem, Extremal properties of \(t\)-SEEDs and recursive constructions, Overlarge sets of resolvable idempotent quasigroups, A new class for large sets of almost Hamilton cycle decompositions, More results on large sets of Kirkman triple systems, Large sets of Hamilton cycle and path decompositions of complete bipartite graphs, Large sets of almost Hamilton cycle and path decompositions of complete bipartite graphs, \(\lambda \)-fold indecomposable large sets of Steiner triple systems, Probabilistic existence of large sets of designs, Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions, Further results on large sets of partitioned incomplete Latin squares, Orthogonal cycle systems with cycle length less than 10, The existence of large set of symmetric partitioned incomplete latin squares, An improved recursive construction for disjoint Steiner quadruple systems, Doubly resolvable Steiner quadruple systems of orders \(2^{2n+1}\), Multicolor Ramsey numbers for triple systems, Classification of partitions of all triples on ten points into copies of Fano and affine planes, On large sets of Kirkman triple systems and 3-wise balanced design., New large sets of resolvable Mendelsohn triple systems, Optimal ternary constant-composition codes with weight four and distance three, New lower bounds on 2-spontaneous emission error designs, Intersecting designs, Coloured and Directed Designs, Large sets of Hamilton cycle decompositions of complete bipartite graphs, Combining \(t\)-designs, Completely reducible super-simple designs with block size five and index two, Optimal partitions for triples, Partitions of triples into optimal packings, On the existence of \(d\)-homogeneous \(\mu\)-way \((v, 3, 2)\) Steiner trades, Large sets of Hamilton cycle and path decompositions, Large sets of Kirkman triple systems with order \(q^n + 2\), A completion of \(LS(2^n4^1)\), Direct constructions of large sets of Kirkman triple systems, Further results about large sets of disjoint Mendelsohn triple systems, Further results on large sets of disjoint group-divisible designs, Optimal covering designs: complexity results and new bounds, Asymptotic Bounds for General Covering Designs, Large sets of disjoint packings on \(6k+5\) points, Large sets of Kirkman triple systems of orders \(2^{2 n + 1} + 1\), Partition of triples of order \(6 k +5\) into \(6 k +3\) optimal packings and one packing of size \(8 k +4\), Further results on 3-spontaneous emission error designs, Large sets with multiplicity, Well-Balanced Designs for Data Placement, Bounds on the sizes of constant weight covering codes, Orthogonal decomposition and packing of complete graphs, Bounds on the Dimensions of 2-Spontaneous Emission Error Designs, Existence of good large sets of Steiner triple systems, Some infinite families of large sets of \(t\)-designs, A new existence proof for large sets of disjoint Steiner triple systems, Large sets with holes, Mutually orthogonal cycle systems
Cites Work
- Unnamed Item
- On large sets of disjoint Steiner triple systems. VI
- Non-SUSY \(p\)-branes, bubbles and tubular branes
- Some packings with Steiner triple systems
- A theorem on the maximum number of disjoint Steiner triple systems
- Partitions of the 4-subsets of a 13-set into disjoint projective planes
- On resolvable designs
- On the maximum number of disjoint Steiner triple systems
