Anti-mitre Steiner triple systems

DOI10.1007/BF02986668zbMath0815.05017OpenAlexW2030214550MaRDI QIDQ1340119

Jozef Širáň, Alexander Rosa, Charles J. Colbourn, Eric Mendelsohn

Publication date: 3 May 1995

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02986668

zbMATH Keywords

mitreSteiner triple systemPasch configurationanti-mitreanti-mitre STS

Mathematics Subject Classification ID

Triple systems (05B07)

Related Items (9)

On 6-sparse Steiner triple systems ⋮ Uniform hypergraphs containing no grids ⋮ Rank inequalities and separation algorithms for packing designs and sparse triple systems. ⋮ Sparse Steiner triple systems of order 21 ⋮ Asymptotically optimal erasure-resilient codes for large disk arrays. ⋮ Nonexistence of sparse triple systems over abelian groups and involutions ⋮ Counting configurations in designs ⋮ Small stopping sets in Steiner triple systems ⋮ Further 6-sparse Steiner triple systems

Cites Work

• Some results on quadrilaterals in Steiner triple systems
• On Cyclic Steiner 2-Designs
• The Structure of Certain Triple Systems
• Extremal problems for triple systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Anti-mitre Steiner triple systems