Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-25T08:49:55.134Z Has data issue: false hasContentIssue false
  • English
  • Français

Set mappings defined on pairs

Part of: Set theory

Published online by Cambridge University Press:  09 April 2009

N. H. Williams
N. H. Williams
Affiliation:
Department of Mathematics, University of Queensland, St. Lucia, Queensland, Australia 4067
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.

A set mapping on pairs over the set S is a function f such that for each unordered pair a of elements of S,f(a) is a subset of S disjoint from a. A subset H of S is said to be free for f if x∉ f({y, z}) for all x, y, z from H. In this paper, we investigate conditions imposed on the range of f which ensure that there is a large set free for f. For example, we show that if f is defined on a set of size K+ + with always |f(a)| <k then f has a free set of size K+ if the range of f satisfies the k-chain condition, or if any two sets in the range of f have an intersection of size less than θ for some θ with θ < K.

MSC classification

Secondary: 03E05: Other combinatorial set theory
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 30 , Issue 3 , February 1981 , pp. 356 - 365
Copyright
Copyright © Australian Mathematical Society 1981

References

Erdös, P. (1950), ‘Some remarks on set theory’, Proc. Amer. Math. Soc. 1, 127–141.CrossRefGoogle Scholar
Erdös, P. and Hajnal, A. (1958), ‘On the structure of set-mappings’, Ada Math. Acad. Sci. Hungar. 9, 111–131.CrossRefGoogle Scholar
Erdös, P., Hajnal, A. and Mate, A. (1973), ‘Chain conditions on set mappings and free sets’, Acda Sci. Math. (Szeged) 34, 69–79.Google Scholar
Erdös, P., Hajnal, A. and Rado, R. (1965), ‘Partition relations for cardinal numbers’, Acda Math. Acad. Sci. Hungar. 16, 93–196.Google Scholar
Hajnal, A. (1960), ‘Some results and problems on set theory’, Acta Math. Acad. Sci. Hungar. 11, 277–298.CrossRefGoogle Scholar
Hajnal, A. and Máté, A. (1975), ‘Set mappings, partitions, and chromatic numbers’, Logic Colloquium '73, edited Rose, H. E. and Shepherdson, J. C., pp. 347–379 (North Holland, Amsterdam).Google Scholar
Máté, A. (1967), ‘On the cardinality of strongly almost disjoint systems’, Acta Math. Acad. Sci. Hungar. 18, 1–3.CrossRefGoogle Scholar
Williams, N. H. (1977), Combinatorial set theory (North Holland, Amsterdam, New York, Oxford).Google Scholar