On a problem of Erdős and Rado (Q1387613): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02558478 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2318625709 / rank | |||
Normal rank |
Latest revision as of 11:50, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a problem of Erdős and Rado |
scientific article |
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