Ramsey numbers of ordered graphs

DOI10.1016/j.endm.2015.06.059zbMath1346.05179arXiv1310.7208OpenAlexW2964315049MaRDI QIDQ5890913

Martin Balko, Jan Kynčl, Karel Král, Josef Cibulka

Publication date: 14 October 2016

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.7208

zbMATH Keywords

Ramsey numberordered graphordered Ramsey number

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (13)

On ordered Ramsey numbers of bounded-degree graphs ⋮ Edge-ordered Ramsey numbers ⋮ Off-diagonal ordered Ramsey numbers of matchings ⋮ Ramsey numbers and monotone colorings ⋮ Ordered Ramsey numbers ⋮ Unnamed Item ⋮ On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness ⋮ Ramsey numbers of ordered graphs ⋮ Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems ⋮ Ramsey numbers for partially-ordered sets ⋮ On edge‐ordered Ramsey numbers ⋮ Minimal ordered Ramsey graphs ⋮ Ramsey numbers of interval 2-chromatic ordered graphs

Cites Work

• Unnamed Item
• The Ramsey number of a graph with bounded maximum degree
• Ramsey-type results for geometric graphs. II
• Ramsey-type results for geometric graphs. I
• Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
• Higher-order Erdős-Szekeres theorems
• Erdős-Szekeres-type theorems for monotone paths and convex bodies
• Some remarks on the theory of graphs
• Ordered Ramsey numbers

This page was built for publication: Ramsey numbers of ordered graphs