A rainbow \(k\)-matching in the complete graph with \(r\) colors
From MaRDI portal
Publication:1028829
zbMath1181.05040MaRDI QIDQ1028829
Kazuhiro Suzuki, Shinya Fujita, Ingo Schiermeyer, Atsushi Kaneko
Publication date: 8 July 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/117512
Related Items (23)
Improved bounds for rainbow numbers of matchings in plane triangulations ⋮ Anti-Ramsey numbers in complete split graphs ⋮ Anti-Ramsey numbers of graphs with small connected components ⋮ Anti-Ramsey number of Hanoi graphs ⋮ Improved approximation for maximum edge colouring problem ⋮ Exact rainbow numbers for matchings in plane triangulations ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Almost color-balanced perfect matchings in color-balanced complete graphs ⋮ Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs ⋮ Anti-Ramsey number of matchings in hypergraphs ⋮ Rainbow numbers for matchings in plane triangulations ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ Rainbow numbers for graphs containing small cycles ⋮ Rainbow numbers for paths in planar graphs ⋮ Anti-Ramsey numbers for disjoint copies of graphs ⋮ Rainbow numbers for small graphs in planar graphs ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees ⋮ Quadratic vertex kernel for rainbow matching ⋮ The anti-Ramsey number of perfect matching ⋮ Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs ⋮ On rainbow matchings in plane triangulations ⋮ Anti-Ramsey numbers for vertex-disjoint triangles
This page was built for publication: A rainbow \(k\)-matching in the complete graph with \(r\) colors
