Hostname: page-component-848d4c4894-tn8tq Total loading time: 0 Render date: 2024-07-02T10:19:27.252Z Has data issue: false hasContentIssue false
  • English
  • Français

A finite set covering theorem III

Published online by Cambridge University Press:  17 April 2009

Alan Brace  and
D.E. Daykin
Alan Brace
Affiliation:
Department of Mathematics, University of Western Australia, Nedlands, Western Australia
D.E. Daykin
Affiliation:
Department of Pure Mathematics, 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 > 2. If a family of n different subsets of a set S, with s elements, has the properties, (i) each member belongs to a set of (t+1) members which together have union S, (ii) no member belongs to a set of t members which together have union S, then we prove that n ≤ (t+1)s−t−1. The result is best possible.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 6 , Issue 3 , June 1972 , pp. 417 - 433
Copyright
Copyright © Australian Mathematical Society 1972

References

[1]Brace, Alan and Daykin, D.E., “A finite set covering theorem”, Bull. Austral. Math. Soc. 5 (1971), 197–202.CrossRefGoogle Scholar