We show that some properties of permutation groups can be applied to the construction of combinatorial objects with given properties.
This is a preview of subscription content, log in via an institution to check access.
References
M. Hall, Jr., The Theory of Groups, Macmillan Company, New York (1959).
F. Harary, Graph Theory, Addison-Wesley, London (1969).
N. Alon, “Eigenvalues and expanders,” Combinatorica, 6, No. 2, 83–96 (1986).
A. D. Glukhov, “Diagnostic ability, connectedness function, and the spectrum of a graph,” Élektron. Model., No. 2, 92–94 (1995).
O. D. Hlukhov, “Investigation of the existence of some combinatorial objects by the methods of the theory of permutation groups,” in: Abstr. of the First Ukrainian Mathematical Congress (Kyiv, 2001) [in Ukrainian], Kyiv (2001), pp. 62–63.
Author information
Authors and Affiliations
Additional information
Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 60, No. 11, pp. 1568–1571, November, 2008.
Rights and permissions
About this article
Cite this article
Hlukhov, O.D. On the application of permutation groups to some combinatorial problems. Ukr Math J 60, 1840–1844 (2008). https://doi.org/10.1007/s11253-009-0173-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11253-009-0173-5