Steiner üçlülerinin kesişimi problemleri

A Steiner triple system of order n (STS(n)) is a pair (S, T ) where S is a set ofsymbols of size n and T is a collection of 3 element subsets of S (triples) such thateach pair of distinct elements of S belongs to exactly one triple of T . It is known thata Steiner triple system exists if and only if n ? 1, 3 (mod 6). Given a Steiner triplesystem (S, T ), the flower at an element x of S is defined to be the set of all triplescontaining the element x. Two Steiner triple systems (S, T1) and (S, T2) are said tointersect in k triples if |T1 ? T2| = k. For all orders n ? 1, 3 (mod 6) let J(n) andJf (n) be defined asJ(n) = {k | ? (S, T1) and (S, T2) such that |T1 ? T2| = k} andJf (n) = {k | ? (S, T1) and (S, T2) such that |T1?T2| = k+(n?1)/2 where (n?1)/2of these common triples constitute a common flower}.This thesis is a complete survey on determining J(n) and Jf (n), i.e. on intersectionand flower intersection problems of Steiner triple systems.