Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference4 articles.
1. Ahlswede, R., Khachatrian, L.H.: The complete intersection theorem for systems of finite sets. Eur. J. Combin. 18(2), 125–136 (1997). doi: 10.1006/eujc.1995.0092
2. Borg P.: Maximum hitting of a set by compressed intersecting families. Graphs Combin. 27(6), 785–797 (2011)
3. Erdős, P., Ko, C., Rado, R.: Intersection theorems for systems of finite sets. Quart. J. Math. Oxford Ser. (2) 12, 313–320 (1961)
4. Frankl, P.: The shifting technique in extremal set theory. In: Whitehead, C. (ed.) Surveys in Combinatorics, London Mathematical Society. Lecture Notes Series, vol. 123, pp. 81–110. Cambridge University Press, Cambridge (1987)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献