Ramsey numbers for transitive tournaments (Q1304815)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Ramsey numbers for transitive tournaments |
scientific article; zbMATH DE number 1340369
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ramsey numbers for transitive tournaments |
scientific article; zbMATH DE number 1340369 |
Statements
Ramsey numbers for transitive tournaments (English)
0 references
22 September 1999
0 references
Let \(D_1\) and \(D_2\) denote acyclic digraphs and let \(\rho(D_1,D_2)\) denote the least integer \(n\) such that every 2-colouring of the edges of the transitive tournament with \(n\) nodes contains a monochromatic \(D_i\) for some \(i\). The authors determine the value of \(\rho(D_1,D_2)\) for certain digraphs \(D_1\) and \(D_2\).
0 references
Ramsey numbers
0 references
acyclic digraphs
0 references
transitive tournament
0 references
