Jörn Quistorff, “A new nonexistence result for sharply multiply transitive permutation sets”, Discrete Mathematics, 288, № 1-3, 2004, 185
Neil I. Gillespie, Cheryl E. Praeger, “Diagonally neighbour transitive codes and frequency permutation arrays”, J Algebr Comb, 39, № 3, 2014, 733
Janos Barta, Roberto Montemanni, 2017 Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI), 2017, 154
Xiangliang Kong, Yuanxiao Xi, Bingchen Qian, Gennian Ge, “Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations”, Sci. China Math., 65, № 5, 2022, 1081
Nathan Keller, Noam Lifshitz, Dor Minzer, Ohad Sheinfeld, “On t-intersecting families of permutations”, Advances in Mathematics, 445, 2024, 109650
Zihan Zhang, “A new metric on symmetric groups and applications to block permutation codes”, Des. Codes Cryptogr., 91, № 6, 2023, 2255
Jun Wang, Sophia J. Zhang, “An Erdős–Ko–Rado-type theorem in Coxeter groups”, European Journal of Combinatorics, 29, № 5, 2008, 1112
Hannah Jackson, Kathryn Nyman, Les Reid, “Properties of generalized derangement graphs”, Involve, 6, № 1, 2013, 25
János Barta, Roberto Montemanni, “The Maximum Clique Problem for Permutation Hamming Graphs”, J Optim Theory Appl, 194, № 2, 2022, 492
P.J Cameron, M Deza, P Frankl, “Sharp sets of permutations”, Journal of Algebra, 111, № 1, 1987, 220