Ordered Ramsey numbers (Q5915485)
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 1746229
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ordered Ramsey numbers |
scientific article; zbMATH DE number 1746229 |
Statements
Ordered Ramsey numbers (English)
0 references
28 May 2002
0 references
Let \(TT_n\) denote the transitive tournament on \(n\) vertices and let \(D_1,D_2,\dots, D_k\) be acyclic digraphs. The ordered Ramsey number \(\rho(D_1,D_2,\dots, D_k)\) is the smallest integer \(n\) so that any \(k\)-coloring of the edges of \(TT_n\) admits, for some index \(i\), a copy of \(D_i\) with all of its edges colored with the \(i\)th color. The authors compute several infinite classes of these ordered Ramsey numbers.
0 references
transitive tournament
0 references
acyclic digraphs
0 references
ordered Ramsey number
0 references
0.863563597202301
0 references
0.8219043612480164
0 references
0.8219043612480164
0 references
