Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"Steiner Triple System"”.

  1. Steiner triple systems and cycle structure

    … published his first paper [24], research in Steiner triple systems has grown steadily. With increased and ready access to more powerfiul computers in recent times, this growth has accelerated significantly. Problems are now being solved which were previously considered too 'big' to …

    cent-lancashire Repository record for Steiner triple systems and cycle structure (opens in a new tab)

  2. Combinatorial designs and their automorphism groups

    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 …

    the-open-u Repository record for Combinatorial designs and their automorphism groups (opens in a new tab)

  3. Tricyclic Steiner Triple Systems with 1-Rotational Subsystems.

    <p>A Steiner triple system of order <em>v</em>, denoted <em>STS</em>(<em>v</em>), is said to be <em>tricyclic</em> if it admits an automorphism whose disjoint cyclic decomposition consists of three cycles. In this thesis we give necessary and sufficient conditions for the existence of a tricyclic …

    etsu Repository record for Tricyclic Steiner Triple Systems with 1-Rotational Subsystems. (opens in a new tab)

  4. Eulerian Properties of Design Hypergraphs and Hypergraphs with Small Edge Cuts

    … make the leap from quasi-eulerian to eulerian. A triple system of order n and index λ (denoted TS(n,λ)) is a 3-uniform hypergraph in which every pair of vertices lies together in exactly λ edges. A Steiner triple system of order n is a TS(n,1). We first give a proof that every TS(n,λ) with λ ⩾ 2 …

    ottawa-retro Repository record for Eulerian Properties of Design Hypergraphs and Hypergraphs with Small Edge Cuts (opens in a new tab)