We examine properties of a class of hypertrees, occurring in probability, which are described by sequences of subscripts.

We give, among other results, a new method to construct for each positive integer \(n\) a class of orthogonal designs \( {OD}(4^{n+1};m;4^n m,4^n m,4^n m,4^n m)\), \(m=2^a 10^b 26^c +4^n+1\), \(a,b,c\) non-negative integers.

We verify that \(6\) more of the tum squares of order \(10\) cannot be completed to a triple of mutually orthogonal Latin squares of order \(10\). We find a pair of orthogonal Latin squares of order \(10\) with \(6\) common transversals, \(5\) of which have only a single intersection, and a pair with \(7\) common transversals.

We give a complete solution to the existence problem for subdesigns in complementary \(\mathrm{P}_3\)-decompositions, where \(\mathrm{P}_3\) denotes the path of length three. As a corollary we obtain the spectrum for incomplete designs with block size four and \(\lambda = 2\), having one hole.

In this paper, we give some recursive constructions for large sets of disjoint group-divisible designs with block size \(3\). In particular, we construct new infinite classes of large sets for designs having group-size two. These large sets have applications in cryptography to the construction of perfect threshold schemes.

A decomposition into non-isomorphic matchings, or \(DINIM\) for short, is a partition of the edges of a graph \(G\) into matchings of different sizes. As a special case of our results, we prove that if a graph \(G\) has at least \((2\chi’ – 2)\chi’ + 1\) edges, where \(\chi’ = \chi'(G)\) is the chromatic index of \(G\), then \(G\) has a \(DINIM\). In particular, the \(n\)-dimensional cube, \(Q_n\), \(n \geq 4\), has a \(DINIM\). These results confirm two conjectures which appeared in Chinn and Richter [3].

We present a permutation group whose orbits classify isomorphism of covering projections of the complete graph with \(4\) vertices. Two structure theorems concerning this group are proved.

Constructions have been completed which improve the lower bounds for \(R(4,6)\), \(R(5,6)\) and \(R(3,12)\).

Let \(G\) be a graph with minimum degree \(\delta\). For each \(i = 1, 2, \ldots, \delta \), let \(a_i(G)\) (resp. \(\alpha^*_i(G)\)) denote the smallest integer \(k\) such that \(G\) has an \([i, k]\)-factor (resp. a connected \([i, k]\)-factor). Denote by \(G_n\) a complete \(n\)-partite graph. In this paper, we determine the value of \(\alpha_t(G_n)\), and show that \(0 \leq \alpha^*_1(G_n) – \alpha(G_n) \leq 1\) and \(\alpha^*_i(G_n) = a_i(G_n)\) for each \(i = 2, 3, \ldots, \delta\).