# Rainbow matching

In the mathematical discipline of graph theory, a rainbow matching in an edge-colored graph is a matching in which all the edges have distinct colorsâ€¦Â (More)
Wikipedia

2009-2017

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Aharoni and Berger conjectured that every collection of n matchings of size n+1 in a bipartite graph contains a rainbow matchingâ€¦Â (More)
Is this relevant?
2017
2017
• Periodica Mathematica Hungarica
• 2017
Suppose that k is a non-negative integer and a bipartite multigraph G is the union of N = âŒŠ k + 2 k + 1 n âŒ‹ âˆ’ (k + 1) matchingsâ€¦Â (More)
Is this relevant?
2016
2016
• Electr. J. Comb.
• 2016
A conjecture by Aharoni and Berger states that every family of n matchings of size n + 1 in a bipartite multigraph contains aâ€¦Â (More)
Is this relevant?
2015
2015
Let G be an edge-coloured graph. A rainbow subgraph in G is a subgraph such that its edges have distinct colours. The minimumâ€¦Â (More)
Is this relevant?
2014
2014
• Electr. J. Comb.
• 2014
Given a coloring of the edges of a multi-hypergraph, a rainbow t-matching is a collection of t disjoint edges, each having aâ€¦Â (More)
Is this relevant?
2014
2014
• Australasian J. Combinatorics
• 2014
We show that there exists a bipartite graph containing n matchings of sizes mi n satisfying âˆ‘ i mi = n 2 + n/2 âˆ’ 1, such that theâ€¦Â (More)
Is this relevant?
2012
2012
• Combinatorics, Probability & Computing
• 2012
A rainbow subgraph of an edge-coloured graph is a subgraph whose edges have distinct colours. The colour degree of a vertex v isâ€¦Â (More)
Is this relevant?
2011
2011
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â€¦Â (More)
Is this relevant?
2011
2011
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â€¦Â (More)
Is this relevant?
2010
2010
• Electr. J. Comb.
• 2010
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â€¦Â (More)
Is this relevant?