Abstract
We find the maximal number of permutations on a set of n elements such that any pair of permutations has at least t common cycles.
Similar content being viewed by others
References
Ku, C.Y. and Renshaw, D., Erdős-Ko-Rado Theorems for Permutations and Set Partitions, J. Combin. Theory, Ser. A, 2008, vol. 115, no. 6, pp. 1008–1020.
Cameron, P.J. and Ku, C.Y., Intersecting Families of Permutations, European J. Combin. 2003, vol. 24, no. 7, pp. 881–890.
Larose, B. and Malvenuto, C., Stable Sets of Maximal Size in Kneser-type Graphs, European J. Combin., 2004, vol. 25, no. 5, pp. 657–673.
Ahlswede, R. and Khachatrian, L.H., The Complete Intersection Theorem for Systems of Finite Sets, European J. Combin., 1997, vol. 18, no. 2, pp. 125–136.
Ahlswede, R. and Khachatrian, L.H., The Diametric Theorem in Hamming Spaces -Optimal Anticodes, Adv. Appl. Math., 1998, vol. 20, no. 4, pp. 429–449.
Ahlswede, R. and Blinovsky, V., Lectures on Advances in Combinatorics, Berlin: Springer, 2008.
Frankl, P. and Tokushige, N., The Erdős-Ko-Rado Theorem for Integer Sequences, Combinatorica, 1999, vol. 19, no. 1, pp. 55–63.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.M. Blinovsky, 2011, published in Problemy Peredachi Informatsii, 2011, Vol. 47, No. 1, pp. 40–53.
Supported in part by the Russian Foundation for Basic Research, project no. 09-01-00536.
Rights and permissions
About this article
Cite this article
Blinovsky, V.M. Intersection theorem for finite permutations. Probl Inf Transm 47, 34–45 (2011). https://doi.org/10.1134/S0032946011010042
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0032946011010042