Lexicographic Ramsey theory

DOI10.1016/0097-3165(93)90049-EzbMATH Open0773.05097MaRDI QIDQ1803874FDOQ1803874

Authors: Ron Graham, Peter Fishburn 

Publication date: 29 June 1993

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Recommendations

• Erdős-Szekeres theorem for multidimensional arrays
• Higher-order Erdős-Szekeres theorems
• Higher-order Erdős-Szekeres theorems
• A multidimensional generalization of the Erdős-Szekeres lemma on monotone subsequences.
• Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1

zbMATH Keywords

lower boundRamsey theoryErdős-Szekeres theorem

Mathematics Subject Classification ID

Ramsey theory (05D10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Coloring the edges ofkm ×km
• Ramsey's Theorem for n-Parameter Sets
• Monotonic Subsequences
• A short proof that \(N^ 3\) is not a circle containment order
• On circle containment orders
• Canonizing ordering theorems for Hales Jewett structures

Cited In (8)

• Erdős-Szekeres theorem for multidimensional arrays
• A note on the Erdős-Szekeres theorem in two dimensions
• Posets and VPG graphs
• Finite three-dimensional partial orders which are not sphere orders
• Discrete geometry. Abstracts from the workshop held January 21--26, 2024
• Exponential Erdős-Szekeres theorem for matrices
• Turán problems for edge-ordered graphs
• A strengthening of the Erdős-Szekeres theorem

This page was built for publication: Lexicographic Ramsey theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803874)