Let \(f(n)\) denote the number of essentially different factorizations of \(n\). In this paper, we prove that for every odd number \( > 1\), we have \(f(n) \leq c\frac{n}{\log n},\) where \(c\) is a positive constant.

A partition of the edge set of a hypergraph \(H\) into subsets inducing hypergraphs \(H_1,\ldots,H_r\) is said to be a \({decomposition}\) of \(H\) into \(H_1,\ldots,H_r\). A uniform hypergraph \(F = (\bigcup \mathcal{F}, \mathcal{F})\) is a \(\Delta\)-\({system}\) if there is a set \(K \subseteq V(F)\), called the \({kernel}\) of \(F\), such that \(A \cap B = K\) for every \(A, B \in \mathcal{F}\), \(A \neq B\). A disjoint union of \(\Delta\)-systems whose kernels have the same cardinality is said to be a \(constellation\). In the paper, we find sufficient conditions for the existence of a decomposition of a hypergraph \(H\) into:
a) \(\Delta\)-systems having almost equal sizes and kernels of the same cardinality,
b) isomorphic copies of constellations such that the sizes of their components are relatively prime.

In both cases, the sufficient conditions are satisfied by a wide class of hypergraphs \(H\).

The binding number of a graph \(G\) is defined to be the minimum of \(|N(S)|/|S|\) taken over all nonempty \(S \subseteq V(G)\) such that \(N(S) \neq V(G)\). In this paper, another look is taken at the basic properties of the binding number. Several bounds are established, including ones linking the binding number of a tree to the “distribution” of its end-vertices. Further, it is established that under some simple conditions, \(K_{1,3}\)-free graphs have binding number equal to \((p(G) – 1)/(p(G) – \delta(G))\) and applications of this are considered.

Strongly regular graphs are graphs in which every adjacent pair of vertices share \(\lambda\) common neighbours and every non-adjacent pair share \(\mu\) common neighbours. We are interested in strongly regular graphs with \(\lambda = \mu = k\) such that every such set of \(k\) vertices common to any pair always induces a subgraph with a constant number \(x\) of edges. The Friendship Theorem proves that there are no such graphs when \(\lambda = \mu = 1\). We derive constraints which such graphs must satisfy in general, when \(\lambda = \mu > 1\), and \(x \geq 0\), and we find the set of all parameters satisfying the constraints. The result is an infinite, but sparse, collection of parameter sets. The smallest parameter set for which a graph may exist has \(4896\) vertices, with \(k = 1870\).

The idea of a domino square was first introduced by J. A. Edwards et al. in [1]. In the same paper, they posed some problems on this topic. One problem was to find a general construction for a whim domino square of side \(n \equiv 3 \pmod{4}\). In this paper, we solve this problem by using a direct construction. It follows that a whim domino square exists for each odd side [1].

It is shown, through an exhaustive search, that there are no circulant symmetric Williamson matrices of order \(39\). The construction of symmetric but not circulant Williamson-type matrices of order \(39\), first given by Miyamoto, Seberry and Yamada, is given explicitly.

A graph \(G\) is defined by Chvátal \([4]\) to be \(n\) \({tough}\) if, given any set of vertices \(S, S \subseteq G\), \(c(G – S) \leq \frac{|S|}{n}\). We present several results relating to the recognition and construction of \(1\)-tough graphs, including the demonstration that all \(n\)-regular, \(n\)-connected graphs are \(1\)-tough. We introduce the notion of minimal \(1\)-tough graphs, and tough graph augmentation, and present results relating to these topics.