Rainbow Matching in Edge-Colored Graphs
نویسندگان
چکیده
A rainbow subgraph of an edge-colored graph is a subgraph whose edges have distinct colors. The color degree of a vertex v is the number of different colors on edges incident to v. Wang and Li conjectured that for k > 4, every edge-colored graph with minimum color degree at least k contains a rainbow matching of size at least ⌈k/2⌉. We prove the slightly weaker statement that a rainbow matching of size at least ⌊k/2⌋ is guaranteed. We also give sufficient conditions for a rainbow matching of size at least ⌈k/2⌉ that fail to hold only for finitely many exceptions (for each odd k).
منابع مشابه
Rainbow Matchings in Properly Edge Colored Graphs
Let G be a properly edge colored graph. A rainbow matching of G is a matching in which no two edges have the same color. Let δ denote the minimum degree of G. We show that if |V (G)| ≥ 8δ 5 , then G has a rainbow matching of size at least ⌊ 5 ⌋. We also prove that if G is a properly colored triangle-free graph, then G has a rainbow matching of size at least ⌊ 3 ⌋.
متن کاملColor Degree Sum Conditions for Rainbow Triangles in Edge-Colored Graphs
Let G be an edge-colored graph and v a vertex of G. The color degree of v is the number of colors appearing on the edges incident to v. A rainbow triangle in G is one in which all edges have distinct colors. In this paper, we first prove that an edge-colored graph on n vertices contains a rainbow triangle if the color degree sum of any two adjacent vertices is at least n+ 1. Afterwards, we char...
متن کاملLarge Rainbow Matchings in Edge-Colored Graphs
A rainbow subgraph of an edge-colored graph is a subgraph whose edges have distinct colors. The color degree of a vertex v is the number of different colors on edges incident with v. Wang and Li conjectured that for k ≥ 4, every edge-colored graph with minimum color degree k contains a rainbow matching of size at least dk/2e. A properly edge-colored K4 has no such matching, which motivates the ...
متن کاملRainbow Matchings of Size δ(G) in Properly Edge-Colored Graphs
A rainbow matching in an edge-colored graph is a matching in which all the edges have distinct colors. Wang asked if there is a function f(δ) such that a properly edgecolored graph G with minimum degree δ and order at least f(δ) must have a rainbow matching of size δ. We answer this question in the affirmative; an extremal approach yields that f(δ) = 98δ/23 < 4.27δ suffices. Furthermore, we giv...
متن کاملRainbow matchings and partial transversals of Latin squares
In this paper we consider properly edge-colored graphs, i.e. two edges with the same color cannot share an endpoint, so each color class is a matching. A matching is called rainbow if its edges have different colors. The minimum degree of a graph is denoted by δ(G). We show that properly edge colored graphs G with |V (G)| ≥ 4δ(G) − 3 have rainbow matchings of size δ(G), this gives the best know...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 17 شماره
صفحات -
تاریخ انتشار 2010