If \(G\) and \(H\) are graphs, define the Ramsey number \(r(G, H)\) to be the least number \(p\) such that if the edges of the complete graph \(K_p\) are colored red and blue (say), either the red graph contains a copy of \(G\), or the blue graph contains a copy of \(H\). In this paper, we determine the Ramsey number \(r(mC_4, nC_5)\) for any \(m\geq1, n\geq1\).

We construct a complex \(K^n\) of \(m\)-ary relations, \(1 \leq m \leq n+1\), in a finite set \(X \neq Ø\), representing a model of an abstract cellular complex. For such a complex \(K^n\) we define the matrices of incidence and coincidence, the groups of homologies \(\mathcal{H}_m(K^n)\) and cohomologies \(\mathcal{H}^m(K^n)\) on the group of integers \(\mathbf{Z}\), and the Euler characteristic. On a combinatorial basis we derive their main properties. In further publications we will derive more analogues of classical properties, and also applications with respect to the existence of fixed relations in the utilization of the isomorphisms will be investigated. In particular, we intend to complete the theory of hypergraphs with the help of such topological observations.

Colbourn introduced \(V_\lambda(m, t)\) to construct transversal designs with index \(\lambda\). A \(V_\lambda(m, t)\) leads to a \((mt + 1, mt + 2; \lambda,0; t)\)-aussie-difference matrix. In this article, we use Weil’s theorem on character sums to show that for any integer \(\lambda \geq 2\), a \(V_\lambda(m, t)\) always exists in \(GF(mt + 1)\) for any prime power \(mt+1 > B_\lambda(m) = \left[\frac{E+\sqrt{E^2+4F}}{2}\right]^2\), where \(E = \lambda(u-1)(m-1)m^u-m^{u-1}+1,F=(u-1)\lambda m^u\) and \(u = \left\lfloor\frac{m{\lambda}+1+(-1)^{\lambda+1}}{2}\right\rfloor\). In particular, we determine the existence of \(V_{\lambda}(m, t)\) for \((\lambda, m) = (2, 2), (2, 3)\).

A weighted graph \((G,w)\) is a graph \(G = (V, E)\) together with a positive weight-function on its vertices \(w: V \to \mathbf{R}^{>0}\). The weighted domination number \(\gamma_w(G)\) of \((G, w)\) is the minimum weight \(w(D) = \sum_{v \in D} w(v)\) of a vertex set \(D \subseteq V\) with \(N[D] = V\), i.e. a dominating set of \(G\).

For this natural generalization of the well-known domination number, we study some of the classical questions of domination theory. We characterize all extremal graphs for the simple Ore-like bound \(\gamma_w(G) \leq \frac{1}{2}w(V)\) and prove Nordhaus-Gaddum-type inequalities for the weighted domination number.

Generalized Steiner systems GS\(_d(t,k,v,g)\) were first introduced by Etzion and used to construct optimal constant weight codes over an alphabet of size \(g + 1\) with minimum Hamming distance \(d\), in which each codeword has length \(v\) and weight \(k\). It was proved that the necessary conditions for the existence of a GS\(_4(2,4,v,g)\) are also sufficient for \(g = 2, 3\) and \(6\). In this paper, a general result on the existence of a GS\(_4(2,4,v,g)\) is presented. By using this result, we prove that the necessary conditions \(v \equiv 1 \pmod{3}\) and \(v \geq 7\) are also sufficient for the existence of a GS\(_4(2, 4, v, 4)\).

An \(A^3\)-code is an extension of an \(A\)-code in which none of the three participants, transmitter, receiver, and arbiter, is trusted. In this paper, we extend the previous model of \(A^3\)-codes by allowing the transmitter and the receiver to not only individually attack the system, but also collude with the arbiter against the other. We derive information-theoretic lower bounds on the success probability of various attacks, and combinatorial lower bounds on the size of key spaces. We also study the combinatorial structure of optimal \(A^3\)-codes against collusion attacks and give a construction of an optimal code.

We prove that \(15\) is the maximal size of a \(3\)-arc in the projective plane of order \(8\).

A \(k\)-line-distinguishing coloring of a graph \(G = (V,E)\) is a partition of \(V\) into \(k\) sets \(V_1, V_2, \ldots, V_k\) such that \(q(\langle V_i \rangle) \leq 1\) for \(i = 1, \ldots, k\) and \(q(V_i . V_j) \leq 1\) for \(1 \leq i < j \leq k\). If the color classes in a line-distinguishing coloring are also independent. Then it is called a harmonious coloring. A coloring is minimal if when two color classes are combined, we no longer have a coloring of the given type. The upper harmonious chromatic number, \(H(G)\), is defined as the maximum cardinality of a minimal harmonious coloring of a graph \(G\). While the upper line-distinguishing chromatic number, \(H'(G)\), is defined as the maximum cardinality of a minimal line-distinguishing coloring of a graph \(G\). We determine \(H'(C_n)\) and \(H(C_n)\) for an even cycle \(C_n\).

In this paper, we derive an inequality on the existence of bi-level balanced arrays (B-arrays) of strength eight by using a result involving central moments from statistics, and by counting in two ways the number of coincidences of various columns with a specific column. We discuss the use of this inequality in obtaining the maximum number of constraints for these arrays, and present some illustrative examples.