Ordered Ramsey theory and track representations of graphs
From MaRDI portal
Publication:890582
DOI10.4310/JOC.2015.v6.n4.a3zbMath1325.05111MaRDI QIDQ890582
Douglas B. West, Derrick Stolee, Kevin G. Milans
Publication date: 10 November 2015
Published in: Journal of Combinatorics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Generalized Ramsey theory (05C55) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (15)
The chromatic number of finite type-graphs ⋮ Off-diagonal hypergraph Ramsey numbers ⋮ The Erdős-Hajnal hypergraph Ramsey problem ⋮ Ordered Ramsey numbers of loose paths and matchings ⋮ Three ways to cover a graph ⋮ A positive fraction Erdős-Szekeres theorem and its applications ⋮ Local and union boxicity ⋮ Ramsey numbers and monotone colorings ⋮ Ordered Ramsey numbers ⋮ 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 ⋮ On the geometric Ramsey number of outerplanar graphs ⋮ Ramsey numbers for partially-ordered sets ⋮ Ramsey numbers of interval 2-chromatic ordered graphs
This page was built for publication: Ordered Ramsey theory and track representations of graphs
