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

Topic mentions per year

Topic mentions per year

2009-2017
024620092017

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)
  • figure 1
Is this relevant?
2017
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
A conjecture by Aharoni and Berger states that every family of n matchings of size n + 1 in a bipartite multigraph contains a… (More)
  • figure 1
  • figure 2
  • figure 3
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
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
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
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)
  • figure 1
  • figure 2
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)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2010
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)
  • figure 1
Is this relevant?