Large Rainbow Matchings in General Graphs
نویسنده
چکیده
Let C = (C1, . . . , Cm) be a system of sets. The range of an injective partial choice function from C is called a rainbow set, and is also said to be multicolored by C. If φ is such a partial choice function and i ∈ dom(φ) we say that Ci colors φ(i) in the rainbow set. If the elements of Ci are sets then a rainbow set is said to be a (partial) rainbow matching if its range is a matching, namely it consists of disjoint sets.
منابع مشابه
On rainbow matchings in bipartite graphs
We present recent results regarding rainbow matchings in bipartite graphs. Using topological methods we address a known conjecture of Stein and show that if Kn,n is partitioned into n sets of size n, then a partial rainbow matching of size 2n/3 exists. We generalize a result of Cameron and Wanless and show that for any n matchings of size n in a bipartite graph with 2n vertices there exists a f...
متن کاملLarge Rainbow Matchings in Large 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. We show that if n is large enough (namely, n ≥ 4.25k), then each n-vertex graph G with minimum color degree at least k contains a rainbow matching of size at least k.
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملRainbow Matchings in r-Partite r-Graphs
Given a collection of matchings M = (M1,M2, . . . ,Mq) (repetitions allowed), a matching M contained in ⋃ M is said to be s-rainbow for M if it contains representatives from s matchings Mi (where each edge is allowed to represent just one Mi). Formally, this means that there is a function φ : M → [q] such that e ∈ Mφ(e) for all e ∈ M , and |Im(φ)| > s. Let f(r, s, t) be the maximal k for which ...
متن کاملRainbow Matchings and Rainbow Connectedness
Aharoni and Berger conjectured that every collection of n matchings of size n+1 in a bipartite graph contains a rainbow matching of size n. This conjecture is related to several old conjectures of Ryser, Brualdi, and Stein about transversals in Latin squares. There have been many recent partial results about the Aharoni-Berger Conjecture. The conjecture is known to hold when the matchings are m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016