The Ramsey number
of a graph
F without isolated vertices is the smallest positive integer
n such that every red–blue coloring of
produces a subgraph isomorphic to
F all of whose edges are colored the same. Let
be a set of graphs without isolated vertices. For a positive integer
t, the vertex-disjoint Ramsey number
is the smallest positive integer
n such that every red–blue coloring of the complete graph
of order
n results in at least
t pairwise vertex-disjoint monochromatic graphs in
; while the edge-disjoint Ramsey number
is the smallest positive integer
n such that every red–blue coloring of
produces at least
t pairwise edge-disjoint monochromatic graphs in
. If
and
consists of a single graph
F, then
is the Ramsey number of the graph
F. Thus, the concepts of vertex-disjoint and edge-disjoint Ramsey numbers provide a generalization of the standard Ramsey number. Upper and lower bounds for
and
are established for sets
of graphs without isolated vertices and the sharpness of these bounds is discussed. The primary goal of this paper is to investigate the values of
and
for sets
of graphs of size 2 or 3 without isolated vertices. The exact values of
are determined for all such sets
and all integers
. The exact values of
of certain such sets
with prescribed conditions for all integers
are determined. For some special sets
of graphs of size 2 or 3 without isolated vertices, the exact values of
are determined for
. Additional results, problems, and conjectures are also presented dealing with these two Ramsey concepts for graphs in general.
Full article