Some Remarks on a Combinatorial Theorem of Erdös and Rado
- 1 January 1966
- journal article
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 9 (2) , 155-160
- https://doi.org/10.4153/cmb-1966-019-1
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.Keywords
This publication has 2 references indexed in Scilit:
- On a problem in elementary number theory and a combinatorial problemMathematics of Computation, 1964
- Intersection Theorems for Systems of SetsJournal of the London Mathematical Society, 1960