Some Remarks on a Combinatorial Theorem of Erdös and Rado
Canadian mathematical bulletin, Tome 9 (1966) no. 2, pp. 155-160
Voir la notice de l'article provenant de la source Cambridge University Press
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.
Abbott, H. L. Some Remarks on a Combinatorial Theorem of Erdös and Rado. Canadian mathematical bulletin, Tome 9 (1966) no. 2, pp. 155-160. doi: 10.4153/CMB-1966-019-1
@article{10_4153_CMB_1966_019_1,
author = {Abbott, H. L.},
title = {Some {Remarks} on a {Combinatorial} {Theorem} of {Erd\"os} and {Rado}},
journal = {Canadian mathematical bulletin},
pages = {155--160},
year = {1966},
volume = {9},
number = {2},
doi = {10.4153/CMB-1966-019-1},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1966-019-1/}
}
[1] 1. Erdös, P. and Rado, R., Intersection theorems for systems of sets, Jour. Lon. Math. Soc, 35 (1960) pp. 85-90. Google Scholar
[2] 2. Erdös, P., On a problem in elementary number theory and a combinatorial problem. Math. of Comp., 18, No. 88, (1964) pp. 644-646. Google Scholar
Cité par Sources :