- Mengyu Cao, Benjian Lv, Kaishun Wang, Sanming Zhou, “Nontrivial t-Intersecting Families for Vector Spaces”, SIAM J. Discrete Math., 36, № 3, 2022, 1823
- Yu-shuang Li, Hua-jun Zhang, “Erdös-Ko-Rado theorem for ladder graphs”, Acta Math. Appl. Sin. Engl. Ser., 30, № 3, 2014, 583
- Mengyu Cao, Mei Lu, Benjian Lv, Kaishun Wang, “r-cross t-intersecting families for vector spaces”, Journal of Combinatorial Theory, Series A, 193, 2023, 105688
- Jun Wang, Huajun Zhang, “Intersecting k-uniform families containing a given family”, Discrete Mathematics, 340, № 2, 2017, 140
- Simon R. Blackburn, “Frameproof Codes”, SIAM J. Discrete Math., 16, № 3, 2003, 499
- Fred Holroyd, John Talbot, “Graphs with the Erdős–Ko–Rado property”, Discrete Mathematics, 293, № 1-3, 2005, 165
- Cheng Yeaw Ku, David Renshaw, “Erdős–Ko–Rado theorems for permutations and set partitions”, Journal of Combinatorial Theory, Series A, 115, № 6, 2008, 1008
- Peter Borg, Imre Leader, “Multiple cross-intersecting families of signed sets”, Journal of Combinatorial Theory, Series A, 117, № 5, 2010, 583
- Андрей Михайлович Райгородский, Andrei Mikhailovich Raigorodskii, “Проблема Борсука для целочисленных многогранников”, Матем. сб., 193, № 10, 2002, 139
- Peter Borg, Fred Holroyd, “The Erdős–Ko–Rado properties of set systems defined by double partitions”, Discrete Mathematics, 309, № 14, 2009, 4754