David Ellis, “Forbidding just one intersection, for permutations”, Journal of Combinatorial Theory, Series A, 126, 2014, 136
Konstantin Golubev, “Graphical designs and extremal combinatorics”, Linear Algebra and its Applications, 604, 2020, 490
Yeow Meng Chee, Han Mao Kiah, Alan C. H. Ling, Chengmin Wang, 2012 IEEE International Symposium on Information Theory Proceedings, 2012, 666
Gergely Harcos, Daniel Soltész, “New Bounds on Even Cycle Creating Hamiltonian Paths Using Expander Graphs”, Combinatorica, 40, № 3, 2020, 435
Andriaherimanana Sarobidy Razafimahatratra, “On the intersection density of primitive groups of degree a product of two odd primes”, Journal of Combinatorial Theory, Series A, 194, 2023, 105707
Peter Müller, Gábor Nagy, “On the non-existence of sharply transitive sets of permutations in certain finite permutation groups”, AMC, 5, № 2, 2011, 303
Douglas B. West, Ordered Sets, 1982, 473
Sergey Bereg, Peter J. Dukes, “A lower bound on permutation codes of distance $n-1$”, Des. Codes Cryptogr., 88, № 1, 2020, 63
István Kovács, Daniel Soltész, “On $k$-Neighbor Separated Permutations”, SIAM J. Discrete Math., 33, № 3, 2019, 1691
Sergey Bereg, Linda Morales, I. Hal Sudborough, “Extending permutation arrays: improving MOLS bounds”, Des. Codes Cryptogr., 83, № 3, 2017, 661