Bipartite rainbow numbers of matchings

DOI10.1016/j.disc.2008.05.011zbMath1179.05088arXivmath/0610910OpenAlexW1989888546MaRDI QIDQ1025529

Ze-min Jin, Xue Liang Li, Jian-hua Tu

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0610910

zbMATH Keywords

edge-coloringrainbow numberrainbow subgraph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (26)

Improved bounds for rainbow numbers of matchings in plane triangulations ⋮ Anti-Ramsey numbers in complete split graphs ⋮ Anti-Ramsey number of Hanoi graphs ⋮ Rainbow matchings in an edge-colored planar bipartite graph ⋮ Rainbow number of matchings in planar graphs ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees ⋮ Exact rainbow numbers for matchings in plane triangulations ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Extremal coloring for the anti-Ramsey problem of matchings in complete graphs ⋮ Anti-Ramsey numbers for matchings in regular bipartite graphs ⋮ Turán numbers of vertex-disjoint cliques in \(r\)-partite graphs ⋮ Anti-Ramsey number of matchings in outerplanar graphs ⋮ Anti-Ramsey numbers for matchings in 3-regular bipartite graphs ⋮ Anti-Ramsey number of matchings in a hypergraph ⋮ Rainbow numbers for paths in planar graphs ⋮ Rainbow matchings in edge-colored complete split graphs ⋮ Anti-Ramsey problems for cycles ⋮ Anti-Ramsey coloring for matchings in complete bipartite graphs ⋮ Anti-Ramsey numbers in complete \(k\)-partite graphs ⋮ Rainbow triangles in edge-colored Kneser graphs ⋮ Rainbow numbers for small graphs in planar graphs ⋮ The rainbow number of matchings in regular bipartite graphs ⋮ Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs ⋮ Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs ⋮ On rainbow matchings in plane triangulations ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings

Cites Work

• Unnamed Item
• Unnamed Item
• On restricted colourings of \(K_ n\)
• Matching theory
• Rainbow numbers for matchings and complete graphs
• An anti-Ramsey theorem on cycles
• Bipartite anti-Ramsey numbers of cycles
• On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems

This page was built for publication: Bipartite rainbow numbers of matchings