On tactical configurations, regular bipartite graphs, and (\(v\), \(k\), even)-designs (Q1923484): Difference between revisions

Firstly the equivalence of several combinatorial structures is shown. Regular bipartite graphs are objects in graph theory which became a big theory. Tactical configurations have been discussed (certainly not very much) in the theory of designs and configurations. 0-1 matrices are sometimes discussed in matrix theory or linear algebra. These concepts and their relations are explained, and certain subclasses of these structures are discussed. Some historical sources which seem to be unknown are presented more or less. This paper shows that there have been mathematicians (V. Martinetti, A. Sainte-Lague) who found first results in combinatorial theories at a time when these had not even been established as theories of their own. In the case of \textit{A. M. Baraev} and \textit{I. A. Faradzhev}, whose results were obtained about 20 years ago, the problem seems to be that their paper is written in Russian language; see [Algorithmic studies in combinatorics, Work Collect., Moskva 1978, 25-60 (1978; Zbl 0473.05059)]. A table collecting the results on small regular bipartite graphs is given. Some applications of the structures are also mentioned. The author says that the results of this paper will be used in his forthcoming paper on expander graphs where certain regular bipartite graphs are quite good expanders, i.e., graphs which can be used to build reliable telephone networks, for example. The second application dealt with, is the introduction of new combinatorial structures, the so-called (\(v,k\), even)- and (\(v,k\), odd)-designs. The investigation of these designs can be partitioned into four parts. One of them (\(v,k\), even) (with even \(k\)) is closely related to regular bipartite graphs. The graphs can be used to construct all tactical even/odd-designs. Lots of non-tactical designs are constructed by other means. Even/odd-designs are ``symmetric 2-designs where \(\lambda\) need not but its parity must be constant''. In this sense, they are quite natural generalizations of 2-designs. Lastly some special examples of (\(v,k\), even)-designs are given explicitly.