On a problem of Erdős and Rado
From MaRDI portal
Publication:1387613
DOI10.1007/BF02558478zbMath0895.05043OpenAlexW2318625709MaRDI QIDQ1387613
William J. Mitchell, Jean A. Larson
Publication date: 6 September 1998
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02558478
Generalized Ramsey theory (05C55) Directed graphs (digraphs), tournaments (05C20) Ordinal and cardinal numbers (03E10)
Related Items (3)
Topological Ramsey numbers and countable ordinals ⋮ New bounds on the Ramsey number \(r ( I_m , L_n )\) ⋮ Idiosynchromatic poetry
Cites Work
- Unnamed Item
- Unnamed Item
- Improvement of a partition theorem of Erdős and Rado
- Some Ramsey nu mbers for directed graphs
- A partition calculus in set theory
- The Voting Problem
- Generalized Ramsey Theory for Graphs V. the Ramsey Number of a Digraph
- Partition Relations and Transitivity Domains of Binary Relations
- Disproof of a conjecture of Erdös and moser on tournaments
- Partially Ordered Sets
This page was built for publication: On a problem of Erdős and Rado
