A Class of Ramsey-finite Graphs
نویسندگان
چکیده
Introduction Let F, G and H be finite, undirected graphs without loops or multiple edges . Write F*(G,H) to mean that it the edges of F are colored with two colors, say red and blue, then either the red subgraph of F contains a copy of G or the blue subgraph contains a copy of H . The class of all graphs F (up to isomorphism) such that F.(G,H) will be denoted by R'(G,H) . This class has been studied extensively, for example the generalized Ramsey number r(G,H) is the minimum number of vertices of a graph in R' (G,H) .
منابع مشابه
All Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملSome Ramsey theorems for finite n-colorable and n-chromatic graphs
Given a fixed integer n, we prove Ramsey-type theorems for the classes of all finite ordered n-colorable graphs, finite n-colorable graphs, finite ordered n-chromatic graphs, and finite n-chromatic graphs.
متن کاملMinimal Ordered Ramsey Graphs
An ordered graph is a graph equipped with a linear ordering of its vertex set. A pair of ordered graphs is Ramsey finite if it has only finitely many minimal ordered Ramsey graphs and Ramsey infinite otherwise. Here an ordered graph F is an ordered Ramsey graph of a pair (H,H ′) of ordered graphs if for any coloring of the edges of F in colors red and blue there is either a copy of H with all e...
متن کاملA Ramsey Space of Infinite Polyhedra and the Random Polyhedron
In this paper we introduce a new topological Ramsey space P whose elements are infinite ordered polyhedra. The corresponding familiy AP of finite approximations can be viewed as a class of finite structures. It turns out that the closure of AP under isomorphisms is the class KP of finite ordered polyhedra. Following [8], we show that KP is a Ramsey class. Then, we prove a universal property for...
متن کاملRamsey Properties of Countably Infinite Partial Orderings
A partial ordering P is chain-Ramsey if, for every natural number n and every coloring of the n-element chains from P in finitely many colors, there is a monochromatic subordering Q isomorphic to P. Chain-Ramsey partial orderings stratify naturally into levels. We show that a countably infinite partial ordering with finite levels is chain-Ramsey if and only if it is biembeddable with one of a c...
متن کامل