On a problem of Erdős and Rado (Q1387613)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1160055
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a problem of Erdős and Rado |
scientific article; zbMATH DE number 1160055 |
Statements
On a problem of Erdős and Rado (English)
0 references
6 September 1998
0 references
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.
0 references
tournaments
0 references
directed graphs
0 references
Ramsey numbers
0 references
0.7879167199134827
0 references
0.7659410238265991
0 references
0.7582438588142395
0 references
0.7577213644981384
0 references
