Large rainbow matchings in large graphs

Details Large rainbow matchings in large graphs Large rainbow matchings in large graphs

2012-04-14

arxiv.org/abs/1204.3193v1

Mathematics

Combinatorics

Scientific paper

A \textit{rainbow subgraph} of an edge-colored graph is a subgraph whose edges have distinct colors. The \textit{color degree} of a vertex $v$ is the number of different colors on edges incident to $v$. We show that if $n$ is large enough (namely, $n\geq 4.25k^2$), then each $n$-vertex graph $G$ with minimum color degree at least $k$ contains a rainbow matching of size at least $k$.

Affiliated with

Also associated with

No associations

Rating

Large rainbow matchings in large graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Large rainbow matchings in large graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Large rainbow matchings in large graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-33588