1. A. E. Brouwer, A. M. Cohen and A. Neumaier, Distance-Regular Graphs, Ergebnisse der Mathematik und ihrer Grenzgebiete, Vol. 18, Springer, Berlin-Heidelberg, 1989.
2. B. Barak, P. K. Kothari and D. Steurer, Small-set expansion in shortcode graph and the 2-to-2 conjecture, in 10th Innovations in Theoretical Computer Science Conference, Leibniz International Proceedings in Informatics, Vol. 124, Schloss Dagstuhl, Leibniz-Zentrum für Informatik, Wadern, 2019, Article no. 9.
3. I. Dinur, S. Khot, G. Kindler, D. Minzer and M. Safra, On non-optimally expanding sets in Grassmann graphs, Electronic Colloquium on Computational Complexity, Computational Complexity Foundation, 2017, https://eccc.weizmaim.ac.il/report/2017/094/.
4. I. Dinur, S. Khot, G. Kindler, D. Minzer and M. Safra, Towards a proof of the 2-to-1 games conjecture? in STOC’ 18—Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, ACM, New York, 2018, pp. 376–389.
5. Y. Filmus, Friedgut-Kalai-Naor theorem for slices of the boolean cube, Chicago Journal of Theoretical Computer Science 2016 (2016), Article no. 14.