Glenn Hurlbert, Vikram Kamat, “Erdős–Ko–Rado theorems for chordal graphs and trees”, Journal of Combinatorial Theory, Series A, 118, no. 3, 2011, 829
Peter Borg, Carl Feghali, “The maximum sum of sizes of cross-intersecting families of subsets of a set”, Discrete Mathematics, 345, no. 11, 2022, 112981
Shuchao Li, Huihui Zhang, “Set Systems with L‐Intersections and k‐Wise L‐Intersecting Families”, J of Combinatorial Designs, 24, no. 11, 2016, 514
Peter Borg, “Maximum Hitting of a Set by Compressed Intersecting Families”, Graphs and Combinatorics, 27, no. 6, 2011, 785
S.A. Seyed Fakhari, “Intersecting faces of a simplicial complex via algebraic shifting”, Discrete Mathematics, 339, no. 1, 2016, 78
Peter Borg, “On t-intersecting families of signed sets and permutations”, Discrete Mathematics, 309, no. 10, 2009, 3310
A. E. Guterman, V. K. Lyubimov, A. M. Raigorodskii, S. A. Usachev, “On independence numbers of distance graphs with vertices in {-1,0,1} n : estimates, conjectures, and applications to the Nelson–Erdős–Hadwiger problem and the Borsuk problem”, J Math Sci, 165, no. 6, 2010, 689
Christian Bey, “The Edge-Diametric Theorem in Hamming Spaces”, Electronic Notes in Discrete Mathematics, 21, 2005, 245
Fred Holroyd, Claire Spencer, John Talbot, “Compression and Erdős–Ko–Rado graphs”, Discrete Mathematics, 293, no. 1-3, 2005, 155
Shiquan WU, “Some greedyt-intersecting families of finite sequences”, Acta Mathematicae Applicatae Sinica, 12, no. 4, 1996, 377