Construction Techniques for Anti-Pasch Steiner Triple Systems
From MaRDI portal
Publication:4520427
DOI10.1112/S0024610700008838zbMath0956.05023OpenAlexW2118772688MaRDI QIDQ4520427
Alan C. H. Ling, Charles J. Colbourn, Terry S. Griggs, Michael John Grannell
Publication date: 13 December 2000
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/s0024610700008838
Related Items (16)
Binomial partial Steiner triple systems containing complete graphs ⋮ On 6-sparse Steiner triple systems ⋮ Avoidance in bowtie systems ⋮ Uniform hypergraphs containing no grids ⋮ Optimal and pessimal orderings of Steiner triple systems in disk arrays. ⋮ Anti‐Pasch optimal coverings with triples ⋮ New Steiner 2-designs from old ones by paramodifications ⋮ On a conjecture of Erdős on locally sparse Steiner triple systems ⋮ Asymptotically optimal erasure-resilient codes for large disk arrays. ⋮ Nonexistence of sparse triple systems over abelian groups and involutions ⋮ The configuration polytope of ℓ-line configurations in Steiner triple systems ⋮ Small stopping sets in Steiner triple systems ⋮ Further 6-sparse Steiner triple systems ⋮ A complete classification of the \((15_4 20_3)\)-configurations with at least three \(K_5\)-graphs ⋮ The centre of a Steiner loop and the maxi-Pasch problem ⋮ Quorum systems constructed from combinatorial designs
This page was built for publication: Construction Techniques for Anti-Pasch Steiner Triple Systems
