Ramsey-type results for geometric graphs. I
From MaRDI portal
Publication:1380815
DOI10.1007/PL00009317zbMath0940.05046MaRDI QIDQ1380815
János Pach, Géza Tóth, Gyula Károlyi
Publication date: 22 April 1998
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Related Items (28)
Disjointness graphs of segments in the space ⋮ On the staircases of Gyárfás ⋮ On plane spanning trees and cycles of multicolored point sets with few intersections ⋮ Packing plane spanning trees and paths in complete geometric graphs ⋮ On the chromatic number of some geometric type Kneser graphs ⋮ Unnamed Item ⋮ Connecting colored point sets ⋮ On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids ⋮ Long non-crossing configurations in the plane ⋮ Monochromatic spanning trees and matchings in ordered complete graphs ⋮ Chromatic variants of the Erdős--Szekeres theorem on points in convex position. ⋮ Ramsey numbers of ordered graphs ⋮ String graphs and incomparability graphs ⋮ Ramsey-type constructions for arrangements of segments ⋮ On the Heaviest Increasing or Decreasing Subsequence of a Permutation, and Paths and Matchings on Weighted 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 ⋮ Ramsey numbers of ordered graphs ⋮ Ramsey-type constructions for arrangements of segments ⋮ On the geometric Ramsey number of outerplanar graphs ⋮ Generalized and geometric Ramsey numbers for cycles. ⋮ Sequences of spanning trees and a fixed tree theorem ⋮ A Ramsey-type result for geometric \(\ell\)-hypergraphs ⋮ On the chromatic number of disjointness graphs of curves ⋮ A bipartite analogue of Dilworth's theorem for multiple partial orders ⋮ On geometric graph Ramsey numbers ⋮ Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$
This page was built for publication: Ramsey-type results for geometric graphs. I
