Some derived steiner triple systems
โ Scribed by Kevin T. Phelps
- Book ID
- 108316019
- Publisher
- Elsevier Science
- Year
- 1976
- Tongue
- English
- Weight
- 375 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
To pattittrm, tnto oil ttme 2 Srciner ## 1. lntroductian 1 refer to 131 for the history of the problem. which goes back to 1850; in fxt, Caylcy [ I] showed that there is no packing of arder 7. The existence of a packi!ng of order 9 was discovered by Kirkman 141, and rectiscsvcred ?~erdI t imcs; bu
In a Steiner triple system STS(v) = (V, B), for each pair {a, b} โ V, the cycle graph G a,b can be defined as follows. The vertices of G a,b are V \ {a, b, c} where {a, b, c} โ B. {x, y} is an edge if either {a, x, y} or {b, x, y} โ B. The Steiner triple system is said to be perfect if the cycle gra
Stinson, D.R., Y.J. Wei, Some results on quadrilaterals in Steiner triple systems, Discrete Mathematics 105 (1992) 207-219. In this paper, we study quadrilaterals in Steiner triple systems. We present two recursive constructions for Steiner triple systems having no quadrilaterals. We also consider