Hostname: page-component-77c89778f8-m8s7h Total loading time: 0 Render date: 2024-07-17T04:54:46.414Z Has data issue: false hasContentIssue false
  • English
  • Français

Maximally almost disjoint families of representing sets

Published online by Cambridge University Press:  24 October 2008

Kevin P. Balanda
Kevin P. Balanda
Affiliation:
University of Queensland, Australia
Get access Rights & Permissions [Opens in a new window]

Extract

A family of κ-sized sets is said to be almost disjoint if each pair of sets from the family intersect in a set of power less than κ. Such an almost disjoint family ℋ is defined to be κ-maximally almost disjoint (κ-MAD) if |∪ℋ| = κ and each κ-sized subset of ∪ ℋ intersects some member of ℋ in a set of cardinality κ. A set T is called a representing set of a family if T ⊆ ∪ and T has non-empty intersection with each member of .

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 93 , Issue 1 , January 1983 , pp. 1 - 7
Copyright
Copyright © Cambridge Philosophical Society 1983

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

REFERENCES

(1)Erdös, P., Hajnal, A. and Milner, E. C.On sets of almost disjoint subsets of a set. Acta Mat. Sci. Hungar. 19 (1968), 209–218.Google Scholar
(2)Erdös, P. and Hechler, S. H. On maximal almost disjoint families over singular cardinals. In Infinite and finite sets, vol. 1 (Colloq., Keszthely, 1973; dedicated to Erdös, P. on his 60th birthday), pp. 597–604. Colloq. Math. Soc. János Bolyai, vol. 10 (North Holland, Amsterdam, 1975.)Google Scholar
(3)Williams, N. H.Combinatorial set theory (North Holland, Amsterdam, New York, Oxford, 1977).Google Scholar