Complete arcs in Steiner triple systems

DOI10.1006/JCTA.1997.2834zbMath0884.05017OpenAlexW2094812190MaRDI QIDQ1374194

Charles J. Colbourn, Jeffrey H. Dinitz

Publication date: 1 April 1998

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b581e9508d524bc23d42bc8f919f625c73bab484

zbMATH Keywords

Steiner triple systemcomplete arc

Mathematics Subject Classification ID

Triple systems (05B07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A density version of a geometric Ramsey theorem
• Spanning sets and scattering sets in Steiner triple systems
• Partitioning Steiner triple systems into complete arcs
• Partitioning twofold triple systems into complete arcs
• The minimum independence number for designs
• On complete arcs in Steiner systems S(2,3,v) and S(2,4,v)
• On chromatic number of graphs and set-systems
• Maximal Subsets of a given Set having No Triple in Common with a Steiner Triple System on the set
• A Combinatorial Theorem with an Application to Latin Rectangles

This page was built for publication: Complete arcs in Steiner triple systems