Abstract
A mitre in a Steiner triple system is a set of five triples on seven points, in which two are disjoint. Recursive constructions for Steiner triple systems containing no mitre are developed, leading to such anti-mitre systems for at least 9/16 of the admissible orders. Computational results for small cyclic Steiner triple systems are also included.
Similar content being viewed by others
References
Brouwer, A.E.: Steiner triple systems without forbidden subconfigurations, Mathematisch Centrum Amsterdam, ZW 104–77, 1977
Colbourn, M.J., Mathon, R.: On cyclic Steiner 2-designs, Ann. Discrete Math.7, 215–253 (1980)
Frenz, T.C., Kreher, D.L.: An algorithm for enumerating distinct cyclic Steiner systems, J. Comb. Math. Comb. Comput.11, 23–32 (1992)
Griggs, T.S., Murphy, J., Phelan, J.S.: Anti-Pasch Steiner triple systems, J. Comb. Inf. Syst. Sci.15, 79–84 (1990)
Lefmann, H., Phelps, K.T., Rödl, V.: Extremal problems for triple systems, J. Combinat. Designs1, 379–394 (1993)
Mathon, R., Phelps, K.T., Rosa, A.: Small Steiner triple systems and their properties, Ars Comb.15, 3–110 (1983)
Robinson, R.M.: The structure of certain triple systems, Math. Comput.20, 223–241 (1975)
Rosa, A.: Algebraic properties of designs and recursive constructions, Congressus Numer.13, 183–200 (1975)
Stinson, D.R., Wei, R.: Some results on quadrilaterals in Steiner triple systems, Discrete Math.105, 207–219 (1992)
Street, A.P., Street, DJ.: The Combinatorics of Experimental Design, Clarendon Press, Oxford, 1987
Teirlinck, L.: Large sets of disjoint designs and related structures, in: Contemporary Design Theory (J.H. Dinitz and D.R. Stinson, eds.) Wiley, New York, 1992, pp. 561–592
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Colbourn, C.J., Mendelsohn, E., Rosa, A. et al. Anti-mitre steiner triple systems. Graphs and Combinatorics 10, 215–224 (1994). https://doi.org/10.1007/BF02986668
Issue Date:
DOI: https://doi.org/10.1007/BF02986668