Ramsey-Type Theorem for Spatial Graphs

1998 ◽  
Vol 14 (1) ◽  
pp. 75-80 ◽  
Author(s):  
Seiya Negami
Keyword(s):  
Type Theorem ◽  
Spatial Graphs ◽  
Ramsey Type

scholarly journals A Ramsey-Type Theorem in the Plane

1994 ◽  
Vol 3 (1) ◽  
pp. 127-135 ◽  
Author(s):  
Jaroslav Nešetřil ◽  
Pavel Valtr
Keyword(s):  
Convex Hull ◽  
Type Theorem ◽  
Finite Set ◽  
Ramsey Type

We show that, for any finite set P of points in the plane and for any integer k ≥ 2, there is a finite set R = R(P, k) with the following property: for any k-colouring of R there is a monochromatic set , ⊆ R, such that is combinatorially equivalent to the set P, and the convex hull of P contains no point of R \ . We also consider related questions for colourings of p-element subsets of R (p > 1), and show that these analogues have negative solutions.

scholarly journals A Ramsey-type theorem for traceable graphs

1982 ◽  
Vol 33 (1) ◽  
pp. 7-16 ◽  
Author(s):  
F Galvin ◽  
I Rival ◽  
B Sands
Keyword(s):  
Type Theorem ◽  
Ramsey Type

A Ramsey-type theorem for the matching number regarding connected graphs

2020 ◽  
Vol 343 (2) ◽  
pp. 111648
Author(s):  
Ilkyoo Choi ◽  
Michitaka Furuya ◽  
Ringi Kim ◽  
Boram Park
Keyword(s):  
Type Theorem ◽  
Matching Number ◽  
Connected Graphs ◽  
Ramsey Type

A Ramsey-Type Theorem for Orderings of a Graph

1989 ◽  
Vol 2 (3) ◽  
pp. 402-406 ◽  
Author(s):  
Vojtech Rödl ◽  
Peter Winkler
Keyword(s):  
Type Theorem ◽  
Ramsey Type
Sign in / Sign up

Export Citation Format

Share Document