On intersecting families of finite sets
Author:
- 1 June 1980
- journal article
- research article
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 21 (3) , 363-372
Abstract
Let F be a family of k-element subsets of an n-set, n > n0(k). Suppose any two members of F have non-empty intersection. Let τ(F) denote min|T|, T meets every member of F. Erdös, Ko and Rado proved and that if equality holds then τ(F) = 1. Hilton and Milner determined max|F| for τ(F) = 2. In this paper we solve the problem for τ(F) = 3.The extremal families look quite complicated which shows the power of the methods used for their determination.Keywords
This publication has 4 references indexed in Scilit:
- On families of finite sets no two of which intersect in a singletonBulletin of the Australian Mathematical Society, 1977
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETSThe Quarterly Journal of Mathematics, 1967
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETSThe Quarterly Journal of Mathematics, 1961
- Intersection Theorems for Systems of SetsJournal of the London Mathematical Society, 1960