- N.M. Singhi, “Tags on subsets”, Discrete Mathematics, 306, № 14, 2006, 1610
- Vince Grolmusz, “Constructing set systems with prescribed intersection sizes”, Journal of Algorithms, 44, № 2, 2002, 321
- Chengyang Qian, Yaokun Wu, Yanzhen Xiong, “Inclusion Matrices for Rainbow Subsets”, Bull. Iran. Math. Soc., 50, № 1, 2024, 2
- Jason O’Neill, “A short note on supersaturation for oddtown and eventown”, Discrete Applied Mathematics, 334, 2023, 63
- Yeow Meng Chee, San Ling, Huaxiong Wang, Liang Feng Zhang, “Upper Bounds on Matching Families in <formula formulatype="inline"> <tex Notation="TeX">$\BBZ_{pq}^{n}$</tex></formula>”, IEEE Trans. Inform. Theory, 59, № 8, 2013, 5131
- Hanno Lefmann, “On Families in Finite Lattices”, European Journal of Combinatorics, 11, № 2, 1990, 165
- László Babai, Péter Frankl, Samuel Kutin, Daniel Štefankovič, “Set Systems with Restricted Intersections modulo Prime Powers”, Journal of Combinatorial Theory, Series A, 95, № 1, 2001, 39
- M. Deza, N. M. Singhi, “Rigid pentagons in hypercubes”, Graphs and Combinatorics, 4, № 1, 1988, 31
- Amitava Bhattacharya, Navin M. Singhi, “Some approaches for solving the general(t,k)-design existence problem and other related problems”, Discrete Applied Mathematics, 161, № 9, 2013, 1180
- Vince Grolmusz, Benny Sudakov, “On k-wise set-intersections and k-wise Hamming-distances”, Journal of Combinatorial Theory, Series A, 99, № 1, 2002, 180