On the geometric Ramsey number of outerplanar graphs
From MaRDI portal
Publication:2256584
DOI10.1007/s00454-014-9646-xzbMath1309.05124arXiv1310.7004OpenAlexW3106358798MaRDI QIDQ2256584
Marek Krčál, Pu Gao, Josef Cibulka, Pavel Valtr, Tomáš Valla
Publication date: 19 February 2015
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.7004
Planar graphs; geometric and topological aspects of graph theory (05C10) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items
Ordered Ramsey numbers of loose paths and matchings, Ordered Ramsey numbers, On the geometric Ramsey numbers of trees, Ramsey numbers of ordered graphs, Ramsey numbers for partially-ordered sets
Cites Work
- Posets with cover graph of pathwidth two have bounded dimension
- Graph minors. XX: Wagner's conjecture
- Ordered Ramsey theory and track representations of graphs
- Graph minors. I. Excluding a forest
- Ramsey-type results for geometric graphs. II
- Crossing families
- Obstruction set isolation for the gate matrix layout problem
- Ramsey-type results for geometric graphs. I
- Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
- Graphs with linearly bounded Ramsey numbers
- A decomposition theorem for partially ordered sets
- Ramsey-Type Problems for Geometric Graphs
- On the structure of graphs with path-width at most two
- Erdős-Szekeres-type theorems for monotone paths and convex bodies
- A Dual of Dilworth's Decomposition Theorem
- Ramsey numbers of ordered graphs
