- Christian Bey, “The edge-diametric theorem in Hamming spaces”, Discrete Applied Mathematics, 156, № 9, 2008, 1510
- P. Frankl, R.M. Wilson, “The Erdös-Ko-Rado theorem for vector spaces”, Journal of Combinatorial Theory, Series A, 43, № 2, 1986, 228
- Peter Borg, “Cross-intersecting non-empty uniform subfamilies of hereditary families”, European Journal of Combinatorics, 78, 2019, 256
- Jun Guo, Fenggao Li, Kaishun Wang, “Anzahl formulas of subspaces in symplectic spaces and their applications”, Linear Algebra and its Applications, 438, № 8, 2013, 3321
- Peter Borg, Fred Holroyd, “The Erdős-Ko-Rado properties of various graphs containing singletons”, Discrete Mathematics, 309, № 9, 2009, 2877
- Peter Borg, “Cross-intersecting families of permutations”, Journal of Combinatorial Theory, Series A, 117, № 4, 2010, 483
- L I Bogolubsky, A S Gusev, M M Pyaderkin, A M Raigorodskii, “Independence numbers and chromatic numbers of the random subgraphs of some distance graphs”, Sb. Math., 206, № 10, 2015, 1340
- Peter Borg, Carl Feghali, “A short proof of Talbot’s theorem for intersecting separated sets”, European Journal of Combinatorics, 101, 2022, 103471
- Zoltán Füredi, Kyung-Won Hwang, Paul M. Weichsel, 26, Topics in Discrete Mathematics, 2006, 215
- Jun Wang, Huajun Zhang, “Intersecting families in $\left( {
\begin{array}{c}{[m]}\\ \ell \end{array}
}\right) \cup \left( {
\begin{array}{c}{[n]}\\ k\end{array}
}\right) $”, J Comb Optim, 40, № 4, 2020, 1020