- Petteri Kaski, “Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms”, SIAM J. Discrete Math., 19, № 3, 2005, 664
- Peter Frankl, “An exact result for $(0, \pm \, 1)$ ( 0 , ± 1 ) -vectors”, Optim Lett, 12, № 5, 2018, 1011
- H.L. Abbott, D. Hanson, “On finite Δ-systems II”, Discrete Mathematics, 17, № 2, 1977, 121
- Peter Frankl, “On intersecting families of finite sets”, Journal of Combinatorial Theory, Series A, 24, № 2, 1978, 146
- A. M. Raigorodskii, D. D. Cherkashin, “Extremal problems in hypergraph colourings”, Russ. Math. Surv., 75, № 1, 2020, 89
- Douglas B. West, Ordered Sets, 1982, 473
- Andrei Mikhailovich Raigorodskii, Danila Dmitrievich Cherkashin, “Ýêñòðåìàëüíûå çàäà÷è â ðàñêðàñêàõ ãèïåðãðàôîâ”, Óñïåõè ìàòåìàòè÷åñêèõ íàóê, 75, № 1(451), 2020, 95
- Péter Frankl, Jian Wang, “Integer sequences without singleton intersection”, Moscow J. Comb. Number Th., 12, № 2, 2023, 127
- M. Deza, P. Frankl, “Erdös–Ko–Rado Theorem—22 Years Later”, SIAM. J. on Algebraic and Discrete Methods, 4, № 4, 1983, 419
- Fabricio Mendoza-Granada, Marcos Villagra, 5, Graphs and Combinatorial Optimization: from Theory to Applications, 2021, 403