2 research outputs found
Rainbow path and color degree in edge colored graphs
Let be an edge colored graph. A {\it}{rainbow path} in is a path in
which all the edges are colored with distinct colors. Let be the color
degree of a vertex in , i.e. the number of distinct colors present on
the edges incident on the vertex . Let be the maximum length of a
rainbow path in . Chen and Li showed that if , for every vertex
of , then (Long
heterochromatic paths in edge-colored graphs, The Electronic Journal of
Combinatorics 12 (2005), # R33, Pages:1-33.) Unfortunately, proof by Chen and
Li is very long and comes to about 23 pages in the journal version. Chen and Li
states in their paper that it was conjectured by Akira Saito, that . They also states in their paper that they
believe for some constant .
In this note, we give a short proof to show that , using an entirely different method. Our proof is only
about 2 pages long. The draw-back is that our bound is less by 1, than the
bound given by Chen and Li. We hope that the new approach adopted in this paper
would eventually lead to the settlement of the conjectures by Saito and/or Chen
and Li.Comment: 4 page
The minimum color degree and a large rainbow cycle in an edge-colored graph
Let be an edge-colored graph with vertices. A subgraph of is
called a rainbow subgraph of if the colors of each pair of the edges in
are distinct. We define the minimum color degree of to be the
smallest number of the colors of the edges that are incident to a vertex ,
for all . Suppose that contains no rainbow-cycle subgraph of
length four. We show that if the minimum color degree of is at least
, then contains a rainbow-cycle subgraph of length at
least , where . Moreover, if the condition of is restricted to
a triangle-free graph that contains a rainbow path of length at least
, then the lower bound of the minimum color degree of that
guarantees an existence of a rainbow-cycle subgraph of length to at least
can be reduced to .Comment: 8 page