Publisher
Springer Science and Business Media LLC
Reference6 articles.
1. Erdős, P., Ko, C., Rado, R.: Intersection theorems for systems of finite sets. Q. J. Math. 12, 310–320 (1961)
2. Frankl, P.: The Erdős–Ko–Rado theorem is true for $$n=ckt$$. In: Combinatorics (Proc. Fifth Hungarian Colloq., Keszthey, 1976), Vol. I, pp. 365–375. Colloq. Math. Soc. János Bolyai, 18, North-Holland, (1978)
3. Frankl, P.: On the number of distinct differences in an intersecting family. Discrete Math. 344(2), 112210 (2021)
4. Frankl, P., Kiselev, S., Kupavskii, A.: Best possible bounds on the number of distinct differences in intersecting families. Eur. J. Combin. 107, 103601 (2023)
5. Marica, J., Schönheim, J.: Differences of sets and a problem of graham. Can. Math. Bull. 12, 635–637 (1969)