A path in an edge-colored graph is said to be
rainbow if no
color repeats on it. An edge-colored graph is said to be
rainbow-connected if
there exist
internally disjoint rainbow paths between each pair of vertices. The
rainbow-connection number
is the minimum number
of colors
such that there
exists a coloring with
colors that makes
rainbow
-connected. Let
be the minimum integer
such that every
-partite
graph with part sizes at least
has
if
and
if
.
Answering a question of Fujita, Liu and Magnant, we show that
for all
,
. We also give some
conditions for which
if
and
if
.
PDF Access Denied
We have not been able to recognize your IP address
216.73.217.26
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.