Partition relations for cardinal numbers
From MaRDI portal
Publication:5541367
DOI10.1007/BF01886396zbMath0158.26603MaRDI QIDQ5541367
Paul Erdős, Richard Rado, Andras Hajnal
Publication date: 1965
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
05E10: Combinatorial aspects of representation theory
03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations
05D10: Ramsey theory
03E05: Other combinatorial set theory
03E10: Ordinal and cardinal numbers
Related Items
In Memoriam: Paul Erdős 1913–1996, Open covers and the square bracket partition relation, The consistency of ZFC + 2ℵ0 > ℵω + ℐ(ℵ2) = ℐ(ℵω), LARGE OPEN COVERS AND A POLARIZED PARTITION RELATION, A Ramsey‐type problem and the Turán numbers*, Logical dreams, Ultrafilters generated by a closed set of functions, The Mathematical Development of Set Theory from Cantor to Cohen, Weak Partition Relations, A polarized partition relation for cardinals of countable cofinality, On chromatic number of graphs and set-systems, On the complete subgraphs of graphs defined by systems of sets, Zur Geometrie der Kreislagerungen, On decomposition of graphs, On sets of almost disjoint subsets of a set, On some functions topological spaces, graphs..., An order property of partition cardinals, Some results and problems on certain polarized partitions, Minimal scrambling sets of simple orders, Strong partition properties for infinite cardinals, Lower bounds for some Ramsey numbers, Ramsey-type theorems, The theorems of Beth and Craig in abstract model theory. III: \(\Delta\)- logics and infinitary logics, Sidon sets in groups and induced subgraphs of Cayley graphs, Aronszajn trees and partitions, Partition relations for partially ordered sets, Extending ideals, Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets, Partitions and sums of integers with repetition, A lower bound for Ramsey's theorem, Remarks on a paper of Hirschfeld concerning Ramsey numbers, A generalization of Ramsey's theorem for regular trees, Colouring without triangles and partition relation, Uniformity of congruences, Partition relations for uncountable ordinals, Disjointness conditions in free products of lattices, Partition theorems for subsets of vector spaces, Infinitary Jonsson algebras and partition relations, Embedding theorems for graphs establishing negative partition relations, Weak versions of Ramsey's theorem, Infinite digraphs with given regular automorphism groups, Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\), Variations on a game, On Erdős-Rado numbers, First order theory of permutation groups, Lower bounds for hypergraph Ramsey numbers, Partitions of the set of finite sequences, A proof of Shelah's partition theorem, On a problem of de Groot and a topological theorem of Ramsey type, On a problem of Erdős, Hajnal and Rado, On a Ramsey type theorem, Ordinary partition relations for ordinal numbers, Some counterexamples in the partition calculus, Notes on combinatorial set theory, A polarized partition relation using elementary substructures, Set mappings of unrestricted order, A polarized partition relation for weakly compact cardinals using elementary substructures, Weak square bracket relations for Pκ(λ), A theorem on polarised partition relations for singular cardinals, Canonization theorems and applications, Weak compactness and square bracket partition relations, Some Universal Sets of Terms, Intersection theorems for systems of sets (III), Chain conditions and the existence of delta-families, On set systems having paradoxical covering properties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On families of mutually exclusive sets
- A partition calculus in set theory
- Graph Theory and Probability
- Graph Theory and Probability. II
- Proof of a conjecture of B. Ruziewicz
- On the structure of set-mappings
- Some results and problems on set theory
- On a property of families of sets
- Some remarks on the theory of graphs
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- On non-denumerable graphs
- Combinatorial Relations and Chromatic Graphs
