Geodesic
Steiner Triple Systems Having a Prescribed Number of Triples in Common
Canadian journal of mathematics, Tome 27 (1975) no. 5, pp. 1166-1175

Voir la notice de l'article provenant de la source Cambridge University Press

A Steiner triple system (briefly STS) is a pair where S is a finite set and is a collection of 3-subsets of S (called triples) such that every pair of distinct elements of S belongs to exactly one triple of . The number |S| is called the order of . It is well-known that there is an STS of order if and only if or 3 (mod 6). Therefore in saying that a certain property concerning STS is true for all it is understood that or 3 (mod 6). An STS of order v will sometimes be denoted by . 
Lindner, C. C.; Rosa, A. Steiner Triple Systems Having a Prescribed Number of Triples in Common. Canadian journal of mathematics, Tome 27 (1975) no. 5, pp. 1166-1175. doi: 10.4153/CJM-1975-122-4
@article{10_4153_CJM_1975_122_4,
     author = {Lindner, C. C. and Rosa, A.},
     title = {Steiner {Triple} {Systems} {Having} a {Prescribed} {Number} of {Triples} in {Common}},
     journal = {Canadian journal of mathematics},
     pages = {1166--1175},
     year = {1975},
     volume = {27},
     number = {5},
     doi = {10.4153/CJM-1975-122-4},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1975-122-4/}
}
TY  - JOUR
AU  - Lindner, C. C.
AU  - Rosa, A.
TI  - Steiner Triple Systems Having a Prescribed Number of Triples in Common
JO  - Canadian journal of mathematics
PY  - 1975
SP  - 1166
EP  - 1175
VL  - 27
IS  - 5
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1975-122-4/
DO  - 10.4153/CJM-1975-122-4
ID  - 10_4153_CJM_1975_122_4
ER  - 
%0 Journal Article
%A Lindner, C. C.
%A Rosa, A.
%T Steiner Triple Systems Having a Prescribed Number of Triples in Common
%J Canadian journal of mathematics
%D 1975
%P 1166-1175
%V 27
%N 5
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1975-122-4/
%R 10.4153/CJM-1975-122-4
%F 10_4153_CJM_1975_122_4

[1] 1. Doyen, J., Constructions of disjoint Steiner triple systems, Proc. Amer. Math. Soc. 32 (1972), 409–416. Google Scholar

[2] 2. Doyen, J. and Wilson, R. M., Embeddings of Steiner triple systems, Discrete Math. 5 (1973), 229–239. Google Scholar

[3] 3. Hall, M. Jr., Combinatorial Theory (Ginn-Blaisdell, Waltham, Mass., 1967). Google Scholar

[4] 4. Harary, F., Graph Theory (Addison-Wesley, Reading, Mass., 1969). Google Scholar

[5] 5. Kramer, E. S. and Mesner, D. M., Intersections among Steiner systems, J. Combinatorial Theory, Ser. A 16 (1974), 273–285. Google Scholar

[6] 6. Lindner, C. C., Construction of Steiner triple systems having exactly one triple in common, Can. J. Math. 26 (1974), 225–232. Google Scholar

[7] 7. Lindner, C. C., Mendelsohn, E. and Rosa, A., On the number of 1-factorizations of the complete graph, to appear, J. Comb. Theory (B). Google Scholar

[8] 8. Lindner, C. C. and Rosa, A., On the existence of automorphism-free Steiner triple systems, J. Algebra, 34 (1975),430–443. Google Scholar

[9] 9. Rosa, A., Remark on cyclic Steiner triple systems (in Slovak), Mat.-fyz.casopis 16 (1966), 285–290. Google Scholar

[10] 10. Rosa, A., Steiner triple systems and their chromatic number, Acta Fac. Rerum Natur. Univ. Comenian. Math. 24 (1970), 159–174. Google Scholar

[11] 11. Roselle, D. P., Distributions of integers into s-tuples with given differences, Proc. Manitoba Conference on Numerical Mathematics, Winnipeg 1971, 31–42. Google Scholar

Cité par Sources :