On large sets of disjoint Steiner triple systems. IV
From MaRDI portal
Publication:797587
DOI10.1016/0097-3165(84)90066-9zbMATH Open0545.05014OpenAlexW4206826839MaRDI QIDQ797587FDOQ797587
Authors: Jia-Xi Lu 
Publication date: 1984
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(84)90066-9
Recommendations
Cites Work
- On Quadruple Systems
- Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
- On large sets of disjoint Steiner triple systems. I
- Parallel concepts in graph theory
- Title not available (Why is that?)
- On large sets of disjoint Steiner triple systems. III
- Covering all triples on n marks by disjoint Steiner systems
- Some packings with Steiner triple systems
Cited In (56)
- Existence of \(\mathrm{LS}^+ (2^n 4^1)\)s
- Heffter spaces
- The existence of large set of symmetric partitioned incomplete latin squares
- Existence spectrum of LD designs
- Mutually disjoint Steiner systems from BCH codes
- Partition of ordered triples into uniform holey ordered designs
- New lower bounds on 2-spontaneous emission error designs
- Optimal ternary constant-composition codes with weight four and distance three
- More results on large sets of Kirkman triple systems
- A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
- Large sets of disjoint packings on \(6k+5\) points
- Support sizes of completely decomposable TS\((v, 4)\)
- On large sets of disjoint Steiner triple systems. V
- Mutually orthogonal cycle systems
- Extremal properties of \(t\)-SEEDs and recursive constructions
- Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions
- On large sets of disjoint Steiner triple systems. VI
- Asymptotic Bounds for General Covering Designs
- On the existence of \(d\)-homogeneous \(\mu\)-way \((v, 3, 2)\) Steiner trades
- Hamilton surfaces for the complete even symmetric bipartite graph
- On large sets of Kirkman triple systems and 3-wise balanced design.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multicolor Ramsey numbers for triple systems
- The construction of large sets of idempotent quasigroups
- Well-balanced designs for data placement
- Bounds on the dimensions of 2-spontaneous emission error designs
- Partition of triples of order \(6 k +5\) into \(6 k +3\) optimal packings and one packing of size \(8 k +4\)
- Large sets of \(t\)-designs through partitionable sets: a survey
- Covering 2-paths uniformly
- Partitions of sets of two-fold triple systems, and their relations to some strongly regular graphs
- New results on LR-designs and OLKTSs
- Disjoint partial triple systems of different orders
- Some infinite families of large sets of \(t\)-designs
- Existence of frame-derived H-designs
- Constructions for large sets of \(L\)-intersecting Steiner triple systems
- Further results on large sets of partitioned incomplete Latin squares
- Bounds on the sizes of constant weight covering codes
- Construction of Uniform Designs and Complex-Structured Uniform Designs via Partitionable t-Designss
- Further results on 3-spontaneous emission error designs
- Orthogonal cycle systems with cycle length less than 10
- Indecomposable large sets of Steiner triple systems with indices 5, 6
- New results on large sets of Kirkman triple systems
- 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
- Bounds and constructions of \(t\)-spontaneous emission error designs
- Existence of good large sets of Steiner triple systems
- 2-\((v,5;m)\) spontaneous emission error designs
- Completely reducible super-simple designs with block size five and index two
- A new class for large sets of almost Hamilton cycle decompositions
- Large sets of Hamilton cycle and path decompositions of complete bipartite graphs
- Efficient two-stage group testing algorithms for genetic screening
- Direct constructions of large sets of Kirkman triple systems
- Title not available (Why is that?)
- Constructions for large sets of \(v-1\{0,{v\over 3}\}\)-intersecting Steiner triple systems of order \(v\)
This page was built for publication: On large sets of disjoint Steiner triple systems. IV
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797587)
