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 9 of 9 for “"Steiner triple systems"”.
-
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 …
-
Anti-pasch and pasch steiner triple systems
… on the study of anti-Pasch and Pasch Steiner triple systems and existence results / concerning these. After the introductory Chapter, Chapters 2, 3, 4, 5 treat anti-Pasch systems and the last the reverse problem of Pasch systems. Chapter 1 introduces the basic concepts and definitions …
-
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 …
-
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 …
-
On the primarity of some block intersection graphs
… thesis, we generalize tactical con gurations on Steiner triple systems obtained from projective geometry. Our objects are subgeometries as blocks. These subgeometries are collected into systems and we study them as designs and graphs. Considered recursively is a further tactical con guration on …
-
Random and exact structures in combinatorics
… of discrete random matrices, thresholds for Steiner triple systems, and improved bounds for Szemerédi's theorem. Each concerns breakthroughs in central questions of the fundamental areas of random matrices, combinatorial designs, and additive combinatorics.
-
List, Sample, and Count
… in several areas including construction of Steiner triple systems, binary sequences with controllable complexity, interference resistant codes, and graph labeling. Finally, we consider a variation of the n-queens problem, called the queens of the night. This constraint satisfaction problem …
-
Probabilistic and Analytic Methods in Combinatorics
… of Erdős regarding the existence of high girth Steiner triple systems. The tools employed fall squarely within the context of probabilistic method, drawing on recent advances within design theory and the theory of random processes. The third and fourth chapters of this thesis consider problems …