Ramsey-type results for geometric graphs. II
From MaRDI portal
Publication:1272962
DOI10.1007/PL00009391zbMath0912.05046MaRDI QIDQ1272962
Pavel Valtr, János Pach, Géza Tóth, Gyula Károlyi
Publication date: 16 May 1999
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Related Items (17)
On the staircases of Gyárfás ⋮ On plane spanning trees and cycles of multicolored point sets with few intersections ⋮ Long non-crossing configurations in the plane ⋮ Chromatic variants of the Erdős--Szekeres theorem on points in convex position. ⋮ Ramsey numbers of ordered graphs ⋮ Long alternating paths in bicolored point sets ⋮ Decompositions, partitions, and coverings with convex polygons and pseudo-triangles ⋮ Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs ⋮ On the geometric Ramsey numbers of trees ⋮ A note on a theorem of Perles concerning non-crossing paths in convex geometric graphs ⋮ Ramsey numbers of ordered graphs ⋮ Noncrossing monochromatic subtrees and staircases in 0-1 matrices ⋮ On the geometric Ramsey number of outerplanar graphs ⋮ Generalized and geometric Ramsey numbers for cycles. ⋮ A Ramsey-type result for geometric \(\ell\)-hypergraphs ⋮ On geometric graph Ramsey numbers ⋮ On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets
This page was built for publication: Ramsey-type results for geometric graphs. II
