Best lower bound for the maximum heterochromatic matchings in edge-colored bipartite graphs

2005/12/30 by Lin Hu, Hao Li, Hu, Lin +3
Mathematics · #05C15 #05C38 #05C70 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C15 #msc:05C38 #msc:05C70

paper · pdf · doi:10.48550/arxiv.math/0512653

This paper has been withdrawn

arxiv created 2007/11/30 · arxiv updated 2011/11/10

Abstract

This paper has been withdrawn by the author(s), due an error in the proof.

Related

• Color Degree Condition for Large Heterochromatic Matchings in Edge-Colored Bipartite Graphs
• Sufficient conditions for the existence of perfect heterochromatic matchings in colored graphs
• Two lower bounds for maximum matching
• An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
• Colour-bias perfect matchings in hypergraphs