Ramsey numbers of interval 2-chromatic ordered graphs

DOI10.1007/s00373-019-02057-8zbMath1426.05115arXiv1805.05900OpenAlexW2963118319WikidataQ127585711 ScholiaQ127585711MaRDI QIDQ2334071

Douglas B. West, Dana Neidinger

Publication date: 6 November 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey numberTurán numberordered graphinterval chromatic number2-chromatic graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items

Minimal ordered Ramsey graphs

Cites Work

• Unnamed Item
• Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems
• Minimal ordered Ramsey graphs
• Ordered Ramsey theory and track representations of graphs
• Ordered Ramsey numbers of loose paths and matchings
• Davenport-Schinzel theory of matrices
• Chromatic number of ordered graphs with forbidden ordered subgraphs
• Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
• Forbidden paths and cycles in ordered graphs and matrices
• Erdős-Szekeres-type theorems for monotone paths and convex bodies
• Maximum Size of Reverse-Free Sets of Permutations
• Ramsey numbers of ordered graphs
• Ordered Ramsey numbers
• On the Turán number of ordered forests