Complete solution for the rainbow numbers of matchings
From MaRDI portal
Publication:1025962
DOI10.1016/j.disc.2008.10.002zbMath1218.05045arXivmath/0611490OpenAlexW2038398059MaRDI QIDQ1025962
He Chen, Xue Liang Li, Jian-hua Tu
Publication date: 23 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0611490
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (41)
Improved bounds for rainbow numbers of matchings in plane triangulations ⋮ Turán number of disjoint triangles in 4-partite graphs ⋮ Rainbow matchings in an edge-colored planar bipartite graph ⋮ Rainbow number of matchings in planar graphs ⋮ Sub-Ramsey numbers for matchings ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees ⋮ On the anti-Ramsey number of forests ⋮ Exact rainbow numbers for matchings in plane triangulations ⋮ Extremal coloring for the anti-Ramsey problem of matchings in complete graphs ⋮ Anti-Ramsey number of matchings in hypergraphs ⋮ Anti-Ramsey numbers for matchings in regular bipartite graphs ⋮ Rainbow numbers for matchings in plane triangulations ⋮ Turán numbers of vertex-disjoint cliques in \(r\)-partite graphs ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ Anti-Ramsey problems in the Mycielskian of a cycle ⋮ Extremal numbers of disjoint triangles 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 ⋮ The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs ⋮ Rainbow numbers for paths in planar graphs ⋮ Rainbow matchings in edge-colored complete split graphs ⋮ Anti-Ramsey coloring for matchings in complete bipartite graphs ⋮ Properly colored \(C_4\)'s in edge-colored graphs ⋮ On the anti-Ramsey numbers of linear forests ⋮ 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 ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees ⋮ On the Turán numbers of \(k K_r\) in \(\ell \)-partite graphs ⋮ Complexity of Computing the Anti-Ramsey Numbers for Paths. ⋮ The anti-Ramsey number of perfect matching ⋮ Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs ⋮ Anti-Ramsey numbers of doubly edge-critical graphs ⋮ Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs ⋮ Anti-Ramsey numbers for cycles in \(n\)-prisms ⋮ On rainbow matchings in plane triangulations ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings ⋮ Anti-Ramsey numbers for vertex-disjoint triangles
Cites Work
- Unnamed Item
- Unnamed Item
- On restricted colourings of \(K_ n\)
- Matching theory
- Edge-colorings of complete graphs that avoid polychromatic trees
- Edge-colorings with no large polychromatic stars
- Rainbow numbers for matchings and complete graphs
- An anti-Ramsey theorem on cycles
- On maximal paths and circuits of graphs
- On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
- On a generalized anti-Ramsey problem
This page was built for publication: Complete solution for the rainbow numbers of matchings
