A Theorem on Steiner Systems

DOI10.4153/CJM-1970-117-0zbMATH Open0192.33305OpenAlexW2332001735MaRDI QIDQ5587085FDOQ5587085

Authors: N. S. Mendelsohn 

Publication date: 1970

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1970-117-0

zbMATH Keywords

combinatorics

Mathematics Subject Classification ID

Steiner systems in finite geometry (51E10) Triple systems (05B07)

Cited In (16)

• Title not available (Why is that?)
• Bussey systems and Steiner's tactical problem
• A new generalization of the Steiner formula and the Holditch theorem
• Linear spaces and steiner systems
• Extending t-designs
• High order intersection numbers of \(t\)-designs
• Intersections among Steiner systems
• On block-schematic Steiner systems S(t,t+1,v)
• The family of t-designs. Part I
• 5-design and counter 5-design in the binary Golay code of length 24
• The family of t-designs. II
• Some extremal connectivity results for matroids
• Historical notes on Steiner systems
• An extension of Cameron's result on block schematic Steiner systems
• On uniform covers and t-designs
• Some remarks on Steiner systems

This page was built for publication: A Theorem on Steiner Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5587085)