This is a preview of subscription content, log in via an institution to check access.
Literature Cited
M. Reiss, “Über eine Steinersche kombinatorische Aufgabe,” J. Reine Angew. Math., No. 56, 326–344 (1859).
P. T. Kirkman, “On a problem in combinations,” Cambr. Dublin Math. J., No. 2, 191–204 (1847).
N. P. Korovina, “On some classes of systems of pair groups,” Kombinatornyi Anal. No. 3, 43–48 (1974).
J. P. Neporozhnev, “Nonexistence of a certain type of finite projective plane of order 10,” Perm. Politekh. Inst. Sb. Nauchn. Tr.,21, 108–123 (1966).
A. Ya. Petrenyuk, “Application of invariants in combinatorial investigations,” Tr. Sem. Kombinatornol Mat., 129–136, Sov. Radio, Moscow (1973).
N. P. Korovina, “On the construction of closed triples of pair groups of order 12,” Kombinatornyi Anal., No. 2, 42–45 (1972).
V. V. Voznyak and A. Ya. Petrenyuk, “On an algorithm for enumerating systems of pair groups,” Kombinatornyi Anal., No. 2, 38–41 (1972).
I. P. Neporozhnev and A. Ya. Petrenyuk, “A constructive enumeration of systems of pair groups, and lists of systems of Steiner triples,” Kombinatornyi Anal., No. 2, 17–41 (1972).
Additional information
Translated from Kibernetika, No. 1, pp. 6–8, January–February, 1980.
Rights and permissions
About this article
Cite this article
Petrenyuk, A.P., Petrenyuk, A.Y. Intersection of perfect 1-factorizations of complete graphs. Cybern Syst Anal 16, 6–9 (1980). https://doi.org/10.1007/BF01099353
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01099353