On a Ramsey-theoretic property of orders (Q1199999): Difference between revisions

ft is shown that if 3 orders are given on a set of \(3n-1\) elements then there is a subset of \(n\) elements such that at least two of the minima of this set coincide. If two orders are given on a set of \(5n\) elements then there is a subset of \(n+2\) elements and two elements \(a\) and \(b\) such that the minimum and maximum of that subset by either order are \(a\) and \(b\). These results are sharp. In the latter statement, if \(k\) orders are given rather than two, \(5n\) can be replaced by \[ (2^{2^{k+1}-1}- 2^{2^ k-1}-1)n. \]