Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-30T19:27:29.379Z Has data issue: false hasContentIssue false

Some intersection and union theorems for several families of finite sets

Published online by Cambridge University Press:  26 February 2010

A. J. W. Hilton
Affiliation:
Department of Mathematics, The University of Reading, England.
Get access

Extract

In this paper we prove two analogues of the following theorem:

If is a collection of distinct subsets of {1, …, m} such that , ij ⇒ Ai ∩ Aj ≠ ∅, AiAj ≠ {1, …, m} then .

MSC classification

Type
Research Article
Copyright
Copyright © University College London 1978

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Brace, A. and Daykin, D. E.. “Sperner type theorems for finite sets”, Proc. Oxford Conf. on Combinatorics, 1972, I.M.A., eds. Welsh, D. J. A. and Woodall, D. R., 1837.Google Scholar
2.Daykin, D. E. and Lovasz, L.. “The number of values of a Boolean function”, J. London Math. Soc, (2) 12 (1976), 225230.CrossRefGoogle Scholar
3.Erdös, P., Herzog, M. and Schonheim, J.. “An extremal problem on the set of noncoprime divisors of an integer”, Israel J. Math. (1970), 408412.Google Scholar
4.Erdös, P., Ko, Chao and Rado, R.. “Intersection theorems for systems of finite sets”, Quart. J. Math. (Oxford) (2), 12 (1961), 313320.Google Scholar
5.Hilton, A. J. W.. “A theorem on finite sets”, Quart. J. Math. (Oxford) (2), 27 (1976), 3336.Google Scholar
6.Schönheim, J.. “On a problem of Daykin concerning intersecting families of sets”, Proc. British Comb. Conf. 1973, L.M.S. Lecture Note Series 13, McDonough, T. P. and Mavron, V. C. (eds.), 139140.Google Scholar
7.Seymour, P. D.. “On incomparable families of sets”, Mathematika, 20 (1973), 208209.Google Scholar