Sufficient conditions for the existence of perfect heterochromatic matchings in colored graphs

2005/11/24 by Lin Hu, Xueliang Li, Hu, Lin +1
Mathematics · #05C15 #05C38 #05C70 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C15 #msc:05C38 #msc:05C70

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

This paper has been withdrawn

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

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
• Best lower bound for the maximum heterochromatic matchings in edge-colored bipartite graphs
• Colour-bias perfect matchings in hypergraphs
• Matchings with Prescribed Color Counts
• A note on colour-bias perfect matchings in hypergraphs