- Cheng Yeaw Ku, Kok Bin Wong, “An analogue of the Hilton–Milner theorem for set partitions”, Journal of Combinatorial Theory, Series A, 120, № 7, 2013, 1508
- A. A. Davydov, V. V. Zyablov, R. E. Kalimullin, “Special sequences as subcodes of reed-solomon codes”, Probl Inf Transm, 46, № 4, 2010, 321
- Ingo Janiszczak, Wolfgang Lempken, Patric R. J. Östergård, Reiner Staszewski, “Permutation codes invariant under isometries”, Des. Codes Cryptogr., 75, № 3, 2015, 497
- David Ellis, Yuval Filmus, Ehud Friedgut, “A quasi-stability result for dictatorships in S n”, Combinatorica, 35, № 5, 2015, 573
- ALENA ERNST, KAI–UWE SCHMIDT, “Intersection theorems for finite general linear groups”, Math. Proc. Camb. Phil. Soc., 175, № 1, 2023, 129
- Gábor Kun, Benoit Larose, “Maximum stable sets in analogs of Kneser and complete graphs”, European Journal of Combinatorics, 30, № 1, 2009, 17
- Li Wang, “Intersecting families in classical Coxeter groups”, Proceedings of the Edinburgh Mathematical Society, 56, № 3, 2013, 887
- Andrey Kupavskii, Dmitrii Zakharov, “Spread approximations for forbidden intersections problems”, Advances in Mathematics, 445, 2024, 109653
- P. Dukes, N. Sawchuck, “Bounds on permutation codes of distance four”, J Algebr Comb, 31, № 1, 2010, 143
- Cheng Yeaw Ku, Kok Bin Wong, “Onr-crosst-intersecting families for weak compositions”, Discrete Mathematics, 338, № 7, 2015, 1090