Konstantin Golubev, “On the chromatic number of a simplicial complex”, Combinatorica, 37, no. 5, 2017, 953
Janos Barta, Roberto Montemanni, Derek H. Smith, 2014 2nd International Conference on Information and Communication Technology (ICoICT), 2014, 187
Lingfei Jin, “A Construction of Permutation Codes From Rational Function Fields and Improvement to the Gilbert–Varshamov Bound”, IEEE Trans. Inform. Theory, 62, no. 1, 2016, 159
Sophie Huczynska, “Powerline communication and the 36 officers problem”, Phil. Trans. R. Soc. A., 364, no. 1849, 2006, 3199
Yeow Meng Chee, Van Khu Vu, 2014 IEEE International Symposium on Information Theory, 2014, 2959
Cheng Yeaw Ku, Benjamin B. McMillan, “Independent sets of maximal size in tensor powers of vertex‐transitive graphs”, Journal of Graph Theory, 60, no. 4, 2009, 295
Cheng Yeaw Ku, David B. Wales, “Eigenvalues of the derangement graph”, Journal of Combinatorial Theory, Series A, 117, no. 3, 2010, 289
Nancy Eaton, Zoltán Füredi, Alexandr V. Kostochka, Jozef Skokan, “Tree representations of graphs”, European Journal of Combinatorics, 28, no. 4, 2007, 1087
Chris Godsil, Karen Meagher, “A new proof of the Erdős–Ko–Rado theorem for intersecting families of permutations”, European Journal of Combinatorics, 30, no. 2, 2009, 404
M. Deza, 6, Combinatorial Mathematics, Optimal Designs and Their Applications, 1980, 41