Abstract
We reduce the problem of determining the maximum number of permutations of a finite set such that any pair of permutations has at least t common transpositions to the problem of determining the maximum number of permutations of finite set such that any pair has at least t common fixed points. The latter problem was solved by the author in [1].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blinovsky, V.M., Intersection Theorem for Finite Permutations, Probl. Peredachi Inf., 2011, vol. 47, no. 1, pp. 40–53 [Probl. Inf. Trans. (Engl. Transl.), 2011, vol. 47, no. 1, pp. 34–45].
Ellis, D., Friedgut, E., and Pilpel, H., Intersecting Families of Permutations, J. Amer. Math. Soc., 2011, vol. 24, no. 3, pp. 649–682.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.M. Blinovsky, 2012, published in Problemy Peredachi Informatsii, 2012, Vol. 48, No. 1, pp. 80–82.
Supported in part by the Bundesministerium für Bilding and Forschung (BMBF), Germany, grant no. Q1BQ1052.
Rights and permissions
About this article
Cite this article
Blinovsky, V.M. Remark on one problem in extremal combinatorics. Probl Inf Transm 48, 70–71 (2012). https://doi.org/10.1134/S0032946012010073
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0032946012010073