A Ramsey theoretic problem for finite ordered sets (Q1088690)
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: A Ramsey theoretic problem for finite ordered sets |
scientific article; zbMATH DE number 3991558
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Ramsey theoretic problem for finite ordered sets |
scientific article; zbMATH DE number 3991558 |
Statements
A Ramsey theoretic problem for finite ordered sets (English)
0 references
1987
0 references
Some results are presented, about the following Ramsey theoretic problem for finite ordered sets: For each \(n\geq 1\), what is the least integer f(n) so that for every ordered set P of width n, there exists an ordered set Q of width f(n) such that every 2-coloring of the points of Q produces a monochromatic copy of P?
0 references
finite ordered sets
0 references
width
0 references
2-coloring
0 references
monochromatic
0 references
