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)
- 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
- 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
- Complementary Ramsey Numbers
- 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
- A Galvin-Hajnal theorem for generalized cardinal characteristics
- Polarized partition relations
- Partition theorems for subsets of vector spaces
- On decomposition of graphs
- On quantitative aspects of a canonisation theorem for edge‐orderings
- A lower bound for Ramsey's theorem
- Partition relations for uncountable ordinals
- A polarized partition relation for cardinals of countable cofinality
- Cardinal characteristics of the continuum and partitions
- Title not available (Why is that?)
- Weak square bracket relations for Pκ(λ)
- The Erdős-Hajnal hypergraph Ramsey problem
- On set systems having paradoxical covering properties
- Remarks on a paper of Hirschfeld concerning Ramsey numbers
- Partition Relations for ηα -sets
- On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs
- Extractors for small zero-fixing sources
- Some remarks on polarized partition relations
- A partition relation for successors of large cardinals
- The consistency of one fixed omega
- A strong polarized relation
- In Memoriam: Paul Erdős 1913–1996
- On a problem of de Groot and a topological theorem of Ramsey type
- Some remarks concerning our paper „On the structure of set-mappings” —Non-existence of a two-valued σ-measure for the first uncountable inaccessible cardinal
- Colouring without triangles and partition relation
- Monochromatic tree covers and Ramsey numbers for set-coloured graphs
- A polarized partition relation using elementary substructures
- A short proof of a partion relation for triples
- Countable chain condition in partition calculus
- A proof of Shelah's partition theorem
- 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
- Extending ideals
- 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
- A NOTE ON ORDER‐TYPE HOMOGENEOUS POINT SETS
- 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
- 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
- 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
- Some Universal Sets of Terms
- 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
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)
