- Peter Frankl, Andrey Kupavskii, “Erdős–Ko–Rado theorem for {0,±1}-vectors”, Journal of Combinatorial Theory, Series A, 155, 2018, 157
- Matija Bucić, Nemanja Draganić, Benny Sudakov, Tuan Tran, “Unavoidable hypergraphs”, Journal of Combinatorial Theory, Series B, 151, 2021, 307
- Jacob Fox, János Pach, Andrew Suk, “Sunflowers in Set Systems of Bounded Dimension”, Combinatorica, 43, № 1, 2023, 187
- Peter Frankl, “An exact result for $(0, \pm \, 1)$ ( 0 , ± 1 ) -vectors”, Optim Lett, 12, № 5, 2018, 1011
- P. Frankl, “Pseudo sunflowers”, European Journal of Combinatorics, 104, 2022, 103553
- Daniele Bartoli, Francesco Pavese, “A note on equidistant subspace codes”, Discrete Applied Mathematics, 198, 2016, 291
- Gérard Cohen, Peter Frankl, 75, Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics, 1983, 211
- M. Deza, P. Frankl, “Bounds on the maximum number of vectors with given scalar products”, Proc. Amer. Math. Soc., 95, № 2, 1985, 323
- Tuvi Etzion, Netanel Raviv, “Equidistant codes in the Grassmannian”, Discrete Applied Mathematics, 186, 2015, 87
- Elisa Gorla, Alberto Ravagnani, “Equidistant subspace codes”, Linear Algebra and its Applications, 490, 2016, 48