We discuss the problem of embedding a PTS\((\text{n},\lambda)\) (a partial triple system on \(n\) vertices with index \(\lambda\)) in a TS\((\text{n},\lambda)\) (a triple system with \(n\) vertices and index \(\lambda\)) whenever \(t\) is admissible and \(t \leq 2n+1\). We bring out the close connection between this problem and various edge-colouring problems. The work described is mostly due to the author and C.A. Rodger.

Lander Conjectured: If \(D\) is a \((\text{v, k}, \lambda)\) difference set in an abelian group G with a cyclic Sylow p-subgroup, then p does not divide \((v, n)\), where \(\text{n} = \text{k} – \lambda \).

In a previous paper, the above conjecture was verified for \(\lambda = 3\) and \(\text{k} \leq 500\), except for \(\text{k} = 228, 282\) and \(444\). These three exceptional values are dealt with in this note, thereby verifying Lander’s conjecture completely for \(\lambda = 3\) and \(\text{k} \leq 500\).

Generalized Moore graphs are regular graphs that satisfy an additional distance condition, namely, that there be the maximum number of vertices as close as possible to any particular vertex, when that vertex is considered as root vertex. These graphs form a useful model for the study of various theoretical properties of computer communications networks. In particular, they lend themselves to a discussion of lower bounds for network cost, delay, reliability, and vulnerability. A considerable number of papers have already been published concerning the existence and properties of generalized Moore graphs of valence three, and some initial studies have discussed generalized Moore graphs of valence four, when the number of vertices is less than fourteen. This paper continues the previous studies for those cases when the graph contains a number of vertices that is between fourteen and twenty. In the case of valence three, the graph with a complete second level exists; it is just the Petersen graph. The situation is quite different for valence four; not only does the graph with a complete second level not exist, but the graphs in its immediate “neighbourhood” also fail to exist.

In this paper, we investigate the existence of skew frames with sets of skew transversals. We consider skew frames of type \(1^n\) and skew frames of type \((2^m)^q\) with sets of skew transversals. These frames are equivalent to three-dimensional frames which have complementary \(2\)-dimensional projections with special properties.

All graphs meeting the basic necessary conditions to be the leave graph of a maximal partial triple system with at most thirteen elements are generated. A hill-climbing algorithm is developed to determine which of these candidates are in fact leave graphs. Improved necessary conditions for a graph to be a leave graph are developed.

Some new lower bounds for higher Ramsey numbers are presented. Results concerning generalized hypergraph Ramsey numbers are also given.