Ordered Ramsey theory and track representations of graphs
From MaRDI portal
Publication:890582
DOI10.4310/JOC.2015.V6.N4.A3zbMATH Open1325.05111MaRDI QIDQ890582FDOQ890582
Authors: Kevin G. Milans, Derrick Stolee, Douglas B. West 
Publication date: 10 November 2015
Published in: Journal of Combinatorics (Search for Journal in Brave)
Recommendations
Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Graph representations (geometric and intersection representations, etc.) (05C62) Hypergraphs (05C65)
Cited In (17)
- Ramsey numbers of interval 2-chromatic ordered graphs
- Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems
- Ramsey numbers and monotone colorings
- On the geometric Ramsey number of outerplanar graphs
- Track number of line graphs
- Off-diagonal hypergraph Ramsey numbers
- A positive fraction Erdős-Szekeres theorem and its applications
- The Erdős-Hajnal hypergraph Ramsey problem
- The chromatic number of finite type-graphs
- Three ways to cover a graph
- Ramsey numbers of ordered graphs
- Local and union boxicity
- Ordered Ramsey numbers of loose paths and matchings
- On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness
- A dual Ramsey theorem for finite ordered oriented graphs
- Ramsey numbers for partially-ordered sets
- Ordered Ramsey numbers
This page was built for publication: Ordered Ramsey theory and track representations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890582)
