Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-05T16:22:30.665Z Has data issue: false hasContentIssue false

A finite set covering theorem

Published online by Cambridge University Press:  17 April 2009

Alan Brace
Affiliation:
University of Western Australia, Nedlands, Western Australia;
D.E. Daykin
Affiliation:
University of Reading, Reading, England.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let n, s, t be integers with s > t > 1 and n > (t+2)2S−t−l We prove that if n subsets of a set S with s elements have union S then some t of them have union S. The result is best possible.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1971