This thesis concerns the automorphism groups of Steiner triple systems and of cycle systems. Although most Steiner triple systems have trivial automorphism groups [2], it is widely known that for every abstract group, there exists a Steiner triple system whose automorphism is isomorphic to that group [16]. The well-known Bose construction [4] for Steiner triple systems, which has a number of variants, has a particularly nice structure, which makes it possible to say much about the automorphism group, and in the case of the construction based on an Abelian group, to derive the full automorphism group. The thesis contains a full analysis of these matters. Some of these results have been published by the author in [14]. The thesis also proves new results concerning the automorphism group for Steiner triple systems constructed using the tripling construction. An <i>m</i>-cycle system is a decomposition of a complete graph into cycles of length <i>m</i>. A Steiner triple system is thus a 3-cycle system. The thesis proves the result that for all <i>m</i> > 3, and for each abstract finite group, there exists an <i>m</i>-cycle system whose automorphism group is isomorphic to that group. In addition, the thesis contains a collection of new results concerning the conjecture by Furedi that every Steiner triple system is decomposable into triangles. Although this conjecture is expected to remain open for some time, it is possible to prove it for a number of standard constructions. It is further shown that for sufficiently large <i>v</i>, the number of Steiner triple systems of order <i>v</i> that are decomposable into triangles is at least <i>v</i><sup><i>v</i><sup><i>2</i></sup>(1/54-0(1))</sup>.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:499451 |
| Date | January 2009 |
| Creators | Lovegrove, Graham John |
| Publisher | Open University |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | http://oro.open.ac.uk/54209/ |
Page generated in 0.0017 seconds