Abstract
P. Erdös and R. Rado [1] proved that to each pair of positive integers n and k, with k ≥ 3, there corresponds a least positive integer φ(n, k) such that if is a family of more than φ(n, k) sets, each set with n elements, then some k of the sets have pair-wise the same intersection.
Publisher
Canadian Mathematical Society
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Extremal problems among subsets of a set;Discrete Mathematics;2006-05
2. On set systems not containing delta systems;Graphs and Combinatorics;1992-03
3. References;North-Holland Mathematics Studies;1986
4. Combinatorial properties of systems of sets;Journal of Combinatorial Theory, Series A;1978-05
5. Degrees and matchings;Journal of Combinatorial Theory, Series B;1976-04