Lexicographic Ramsey theory (Q1803874): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Q1104213 / rank | |||
Property / reviewed by | |||
Property / reviewed by: Péter Komjáth / rank | |||
Property / author | |||
Property / author: Peter C. Fishburn / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Péter Komjáth / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5759552 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ramsey's Theorem for n-Parameter Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3903002 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coloring the edges ofkm ×km / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A short proof that \(N^ 3\) is not a circle containment order / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Monotonic Subsequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Canonizing ordering theorems for Hales Jewett structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On circle containment orders / rank | |||
Normal rank |
Latest revision as of 16:56, 17 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lexicographic Ramsey theory |
scientific article |
Statements
Lexicographic Ramsey theory (English)
0 references
29 June 1993
0 references
The following extension of the Erdős-Szekeres theorem is proved. If \(d,n\) are positive integers then there exists an integer \(N\) such that if \(f\) is an injection from \(\{1,2,\dots,N\}^ d\) into the reals then there is an \(n\times\cdots\times n\) subcube on which \(f\) is lexicographic and monotonic on each coordinate. The lower bound \(N>n^{(1-1/d)n^{d-1}}\) is given.
0 references
Ramsey theory
0 references
Erdős-Szekeres theorem
0 references
lower bound
0 references