On Erdős-Rado numbers
From MaRDI portal
Publication:1842571
DOI10.1007/BF01294461zbMath0823.05058OpenAlexW1995368847MaRDI QIDQ1842571
Publication date: 8 June 1995
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01294461
Related Items
Ordered and canonical Ramsey numbers of stars, Rainbow generalizations of Ramsey theory: A survey, On the canonical Ramsey theorem of Erdős and Rado and Ramsey ultrafilters, On quantitative aspects of a canonisation theorem for edge‐orderings, Properly edge-coloured subgraphs in colourings of bounded degree, Edge-colorings avoiding rainbow and monochromatic subgraphs, Canonical Ramsey numbers and properly colored cycles, Unordered canonical Ramsey numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ramsey-type theorems
- On restricted colourings of \(K_ n\)
- Extremal uncrowded hypergraphs
- Asymptotic lower bounds for Ramsey functions
- On canonical Ramsey numbers for complete graphs versus paths
- Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\)
- On a Ramsey type theorem
- Note on Canonical Partitions
- On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
- Canonical Partition Relations
- On uncrowded hypergraphs
- Partition relations for cardinal numbers
- Some remarks on the theory of graphs
- A Combinatorial Theorem
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- An anti-Ramsey theorem
