Peter Borg, “A short proof of an Erdős–Ko–Rado theorem for compositions”, Discrete Mathematics, 333, 2014, 62
Chris Godsil, Karen Meagher, “A new proof of the Erdős–Ko–Rado theorem for intersecting families of permutations”, European Journal of Combinatorics, 30, № 2, 2009, 404
Lev Igorevich Bogolubsky, Anton Sergeevich Gusev, Mikhail Mikhailovich Pyaderkin, Andrei Mikhailovich Raigorodskii, “Числа независимости и хроматические числа случайных подграфов некоторых дистанционных графов”, Математический сборник, 206, № 10, 2015, 3
Aart Blokhuis, Andries Brouwer, Tamás Szőnyi, Zsuzsa Weiner, “On q-analogues and stability theorems”, J. Geom., 101, № 1-2, 2011, 31
Peter Frankl, 5, Mathematics of Ramsey Theory, 1990, 53
Peter Borg, “Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas”, Discrete Mathematics, 341, № 5, 2018, 1331
Peter Borg, “The maximum sum and the maximum product of sizes of cross-intersecting families”, European Journal of Combinatorics, 35, 2014, 117
Péter Frankl, Glenn Hurlbert, “On the Holroyd-Talbot conjecture for sparse graphs”, Discrete Mathematics, 347, № 1, 2024, 113742
Peter Frankl, Zoltán Füredi, “A new short proof of the EKR theorem”, Journal of Combinatorial Theory, Series A, 119, № 6, 2012, 1388
Peter Borg, “Strongly intersecting integer partitions”, Discrete Mathematics, 336, 2014, 80