scientific article; zbMATH DE number 1496588
From MaRDI portal
Publication:4500699
DOI10.1002/1520-6610(2000)8:4%3C300::AID-JCD7%3E3.0.CO;2-RzbMATH Open0959.05016MaRDI QIDQ4500699FDOQ4500699
Authors: Michael John Grannell, T. S. Griggs, Carol A. Whitehead 
Publication date: 20 April 2001
Title of this publication is not available (Why is that?)
Recommendations
Cites Work
Cited In (23)
- Uniform hypergraphs containing no grids
- Avoidance in bowtie systems
- Large girth approximate Steiner triple systems
- Rank inequalities and separation algorithms for packing designs and sparse triple systems.
- Optimal and pessimal orderings of Steiner triple systems in disk arrays.
- The existence of 5-sparse Steiner triple systems of order \(n \equiv 3 \mod 6\), \(n \notin \{9,15 \}\)
- Further 6-sparse Steiner triple systems
- Countable homogeneous Steiner triple systems avoiding specified subsystems
- Properties of Steiner triple systems of order 21
- Combinatorial constructions of repairable ramp schemes
- Generating Uniformly Distributed Random 2-Designs with Block Size 3
- Nonexistence of sparse triple systems over abelian groups and involutions
- On a conjecture of Erdős on locally sparse Steiner triple systems
- A visual representation of the Steiner triple systems of order 13
- On sparse countably infinite Steiner triple systems
- Sparse Steiner triple systems of order 21
- Counting substructures. II: Hypergraphs
- Construction Techniques for Anti-Pasch Steiner Triple Systems
- Anti‐Pasch optimal coverings with triples
- The centre of a Steiner loop and the maxi-Pasch problem
- Small stopping sets in Steiner triple systems
- Combinatorial repairability for threshold schemes
- On 6-sparse Steiner triple systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500699)
