Partition relations for cardinal numbers
From MaRDI portal
Publication:5541367
DOI10.1007/BF01886396zbMATH Open0158.26603OpenAlexW2044949519MaRDI QIDQ5541367FDOQ5541367
Authors: Andras Hajnal, P. Erdős, Richard Rado 
Publication date: 1965
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01886396
Recommendations
Combinatorial aspects of representation theory (05E10) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Other combinatorial set theory (03E05) Ramsey theory (05D10) Ordinal and cardinal numbers (03E10)
Cites Work
- Graph Theory and Probability
- Some remarks on the theory of graphs
- Title not available (Why is that?)
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- On a property of families of sets
- Combinatorial Relations and Chromatic Graphs
- A partition calculus in set theory
- On the structure of set-mappings
- Proof of a conjecture of B. Ruziewicz
- Graph Theory and Probability. II
- On non-denumerable graphs
- On families of mutually exclusive sets
- Some results and problems on set theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Partition calculus and cardinal invariants
- The Erdős–Gyárfás function with respect to Gallai‐colorings
- Two extensions of Ramsey's theorem
- On a Ramsey type theorem
- Combinatorial set theory: Partition relations for cardinals
- Flat covers in abelian and in non-abelian categories
- Large almost monochromatic subsets in hypergraphs
- Embedding theorems for graphs establishing negative partition relations
- Successors of singular cardinals and coloring theorems II
- Notes on combinatorial set theory
- Sidon sets in groups and induced subgraphs of Cayley graphs
- Ramsey properties of algebraic graphs and hypergraphs
- Uniformity of congruences
- WEISS'S QUESTION
- Some logically weak Ramseyan theorems
- Open and solved problems concerning polarized partition relations
- Partition relations for Hurewicz-type selection hypotheses
- Set mappings of unrestricted order
- Ramsey-type results for semi-algebraic relations
- Logical dreams
- Combinatorial aspects of the splitting number
- Strong polarized relations for the continuum
- Ultrafilters generated by a closed set of functions
- Ramsey theory and the Borel conjecture
- Colorful Partitions of Cardinal Numbers
- Strong partition properties for infinite cardinals
- Ramsey numbers of semi-algebraic and semi-linear hypergraphs
- Upper bounds on positional Paris-Harrington games
- Off-diagonal hypergraph Ramsey numbers
- Minimal scrambling sets of simple orders
- On the complete subgraphs of graphs defined by systems of sets
- A Ramsey-type result for geometric \(\ell\)-hypergraphs
- Club-guessing, stationary reflection, and coloring theorems
- More consistency results in partition calculus
- In memoriam: James Earl Baumgartner (1943--2011)
- On chromatic number of graphs and set-systems
- Some partitions of three-dimensional combinatorial cubes
- On a problem of Erdős, Hajnal and Rado
- On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs
- Partitions of products
- The polarised partition relation for order types
- Some counterexamples in the partition calculus
- The Mathematical Development of Set Theory from Cantor to Cohen
- Partition principles and infinite sums of cardinal numbers
- Title not available (Why is that?)
- Getting more colors I
- Variations on a game
- Ramsey-type theorems
- On Erdős-Rado numbers
- On sets of almost disjoint subsets of a set
- Canonization theorems and applications
- Hypergraph Ramsey numbers
- Lower bounds for some Ramsey numbers
- Intersection theorems for systems of sets (III)
- Polarized relations at singulars over successors
- The theorems of Beth and Craig in abstract model theory. III: \(\Delta\)- logics and infinitary logics
- Title not available (Why is that?)
- Ordinary partition relations for ordinal numbers
- Abelian lattice-ordered groups and a characterization of the maximal spectrum of a Prüfer domain.
- Serial compact spaces and the maximal spectrum of a Bézout domain
- Zur Geometrie der Kreislagerungen
- Chain conditions of products, and weakly compact cardinals
- Ordered Ramsey numbers of loose paths and matchings
- First order theory of permutation groups
- An infinite combinatorial statement with a poset parameter
- Partition relations for partially ordered sets
- A Ramsey‐type problem and the Turán numbers*
- A generalization of Ramsey's theorem for regular trees
- On a theorem in the theory of relations and a solution of a problem of Knaster
- Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\)
- Infinitary Jonsson algebras and partition relations
- Disjointness conditions in free products of lattices
- Partitions of the set of finite sequences
- Many partition relations below density
- Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets
- Partitions and sums of integers with repetition
- Aronszajn trees and partitions
- Infinite digraphs with given regular automorphism groups
- An improved bound for the stepping-up lemma
- A note on the Erdős-Hajnal hypergraph Ramsey problem
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension
- Ein Zerlegungssatz für P(\(\kappa\) )
- A note on order-type homogeneous point sets
- Semi-algebraic Ramsey numbers
- Weak Partition Relations
- On 3‐graphs with no four vertices spanning exactly two edges
- Strongly bounded groups of various cardinalities
- Was Ulam right? I: basic theory and subnormal ideals
- Extending ideals
- Two negative partition relations
- Chain conditions and the existence of delta-families
- A polarized partition relation for weakly compact cardinals using elementary substructures
- On Ramsey numbers of hedgehogs
- The dynamic descriptive complexity of \(k\)-clique
- Multicolor Ramsey numbers for triple systems
- Knaster and friends. I: Closed colorings and precalibers
- Partitioning pairs of countable sets of ordinals
- Weak versions of Ramsey's theorem
- Lower bounds for hypergraph Ramsey numbers
- Infinite monochromatic paths and a theorem of Erdős-Hajnal-Rado
This page was built for publication: Partition relations for cardinal numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5541367)
