It is well known that the famous Ramsey number
. That is, the minimum positive integer
n for which every red-blue coloring of the edges of the complete graph
results in
[...] Read more.
It is well known that the famous Ramsey number
. That is, the minimum positive integer
n for which every red-blue coloring of the edges of the complete graph
results in a monochromatic triangle
is 6. It is also known that every red-blue coloring of
results in at least two monochromatic triangles, which need not be vertex-disjoint or edge-disjoint. This fact led to an extension of Ramsey numbers. For a graph
F and a positive integer
t, the vertex-disjoint Ramsey number
is the minimum positive integer
n such that every red-blue coloring of the edges of the complete graph
of order
n results in
t pairwise vertex-disjoint monochromatic copies of subgraphs isomorphic to
F, while the edge-disjoint Ramsey number
is the corresponding number for edge-disjoint subgraphs. Since
and
are the well-known Ramsey numbers of
F, these new Ramsey concepts generalize the Ramsey numbers and provide a new perspective for this classical topic in graph theory. These numbers have been investigated for the two connected graphs
and the path
of order 3. Here, we study these numbers for the remaining connected graphs, namely, the path
and the star
of size 3. We show that
for every positive integer
t and
for every integer
. For
, the numbers
and
are determined. These numbers provide information towards the goal of determining how the numbers
and
increase as
t increases for each graph
.
Full article