# Partition relations for cardinal numbers

```@article{Erds1965PartitionRF,
title={Partition relations for cardinal numbers},
author={P{\'e}ter Erdős and Andr{\'a}s Hajnal and Richard Rado},
year={1965},
volume={16},
pages={93-196}
}```
• Published 1 March 1965
• Mathematics
• Acta Mathematica Academiae Scientiarum Hungarica
1. INTRODUCTION In this paper our main object is the study of relations between cardinal numbers which are written in the form a-(b o , b,,. . .) r or a-(b)C ~° or (b) (b o b,) Such relations were introduced in [3] and [1]. They are called I-relations, Ii-relations and III-relations respectively, and they will be defined in 3. 1, 3. 2 and 3. 3. In sections 18 and 19 we shall introduce certain generalizations of these relations. Our whole theory can be considered as having arisen out of the…
258 Citations
Weak partition relations
The partition relation 1+x1)3 ,,, which was known to contradict the continuLlm hypothesis [1], is disproved without this hypothesis. For cardinals K>?) and 2>1, let P(K, A) be the following partition
Polarized Partition Relations for Ordinal Numbers
• Mathematics
• 1971
invented by Richard Rado is a case in point. By definition, (1.1) means that the following relation between the ordinal [or cardinal) numbers ~1, aO, ai holds: If A is an ordered set of order type a
Weak versions of Ramsey's theorem
• Mathematics
J. Comb. Theory, Ser. B
• 1977
PARTITION RELATIONS FOR q,,-SETS
• Mathematics
For every ordinal number a, an ordered set S is called an rl,,-set if the following condition P,, is satisfied : if A and B are subsets of S, each of cardinal number less than sfi " and if a < b
Weak compactness and square bracket partition relations
• Mathematics
Journal of Symbolic Logic
• 1972
For κ and α cardinals and n an integer the partition relation of Erdos, Hajnal and Rado is defined as follows: for every function F : [ κ ] n → α (called a partition of [ λ ] n , the n -element subsets of κ , into α pieces), there exists a set C ⊆ κ such that card C = λ and F ″[ C ] n ≠ α, i.e.
On set systems having paradoxical covering properties
• Mathematics, Philosophy
• 1978
1. R2-phenomena . Our set theoretic notation will be standard with one exception . Since this paper is largely concerned with powers of ordinals, the symbol ~" will always denote ordinal
Open covers and a polarized partition relation
We show that a strengthened form of a property of Rothberger implies that a certain polarized partition relation holds for the ω–covers of a space, and that this partition relation implies a
INTERSECTION THEOREMS FOR SYSTEMS OF SETS ( III ) Dedicated to the memory of
A system or family (A. : y E N) of sets A y , indexed by the elements of a set N, is called an (a, b)-system if I N I = a and I A,, I = b for y c-N. Expressions such as "(a, < b)-system" are
Ramsey-type results for semi-algebraic relations Citation
• Mathematics
• 2013
A k-ary semi-algebraic relation E on R is a subset of R, the set of k-tuples of points in R , which is determined by a finite number of polynomial equations and inequalities in kd real variables. The
On Ramsey Like Theorems , Problems and Results
• Mathematics
• 2005
(1) n → (k1, . . . , k`)` means that if we split the r-tuples of a set, S, |S| = n into ` classes, than for some i, 1 ≤ i ≤ ` there is a subset Si ⊆ S, |Si| ≥ ki all of whose r-tuples are in the i-th

## References

SHOWING 1-10 OF 38 REFERENCES
Combinatorial Theorems on Classifications of Subsets of a Given Set
• Mathematics
• 1952
Given any positive integers k, n, ANT, there is a positive integer M which has the following property. If S = {1, 2, . . ., A1}, and A is any distribution of Q,(S) into k classes, there is always an
On some problems involving inaccessible cardinals
• Mathematics
• 1961
Introduction(') Many problems in set theory and related domains are known which have the following features in common . Each of them can be formulated as the problem of determining all the infinite
Some remarks on set theory
Let there be given n ordinals a,, a2, , * , a,n. It is well known that every ordinal can be written uniquely as the sum of indecomposable ordinals. (An ordinal is said to be indecomposable if it is
On the structure of set-mappings
• Mathematics
• 1958
1 . Introduction. Let S be a set and f(x) a function which makes correspond to every x E S a subset fix) of S so that x(f (x) . Such a function f(x) we shall call a set-mapping defined on S. A subset
Some remarks on the theory of graphs
The present note consists of some remarks on graphs. A graph G is a set of points some of which are connected by edges. We assume here that no two points are connected by more than one edge. The
A Partition Calculus in Set Theory
• Mathematics
• 1956
Dedekind’s pigeon-hole principle, also known as the box argument or the chest of drawers argument (Schubfachprinzip) can be described, rather vaguely, as follows. If sufficiently many objects are
Combinatorial Relations and Chromatic Graphs
• Mathematics