Improved upper and lower bounds for the digraph Ramsey numbers \(r(K_n^*,L_m)\) are verified, where \(r(K_n^*,L_m)\) is the smallest integer \(p\) such that any digraph of order \(p\) contains either an independent set with \(n\) vertices or a transitive tournament of order \(m\). For example, it is shown that \(r(K_n^*, L_3) \leq n^2\), and in particular that \(13 < r(K_4, L_3) \leq 16\). Recursive upper bounds are given that improve on previous bounds of Erdős and Rado, and also of Bermond.
Recommendations
Cites work
- A partition calculus in set theory
- Disproof of a conjecture of Erdös and moser on tournaments
- Generalized Ramsey Theory for Graphs V. the Ramsey Number of a Digraph
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- scientific article; zbMATH DE number 3221981 (Why is no real title available?)
- Improvement of a partition theorem of Erdős and Rado
- Partially Ordered Sets
- Partition Relations and Transitivity Domains of Binary Relations
- Some Ramsey nu mbers for directed graphs
- The Voting Problem
Cited in
(7)- A solution of the Erdős-Ulam problem on rational distance sets assuming the Bombieri-Lang conjecture
- New bounds on the Ramsey number r ( I_m , L_n )
- Idiosynchromatic poetry
- scientific article; zbMATH DE number 1054222 (Why is no real title available?)
- Topological Ramsey numbers and countable ordinals
- Erdős-Rado without choice
- On a generalized Erdős–Rademacher problem
This page was built for publication: On a problem of Erdős and Rado
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1387613)
