Rainbow matchings in edge-colored complete split graphs
From MaRDI portal
Publication:1746587
DOI10.1016/J.EJC.2018.01.010zbMath1384.05088OpenAlexW2789779990WikidataQ130202935 ScholiaQ130202935MaRDI QIDQ1746587
Publication date: 25 April 2018
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2018.01.010
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (11)
Anti-Ramsey numbers for cycles in the generalized Petersen graphs ⋮ Rainbow matchings in an edge-colored planar bipartite graph ⋮ Rainbow number of matchings in planar graphs ⋮ Anti-Ramsey problems in the Mycielskian of a cycle ⋮ Anti-Ramsey number of matchings in outerplanar 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 triangles in edge-colored Kneser graphs ⋮ Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs ⋮ Anti-Ramsey numbers for cycles in \(n\)-prisms
Cites Work
- Unnamed Item
- Unnamed Item
- Anti-Ramsey numbers in complete split graphs
- On degree anti-Ramsey numbers
- Anti-Ramsey number of matchings in hypergraphs
- Rainbow numbers for matchings in plane triangulations
- Anti-Ramsey coloring for matchings in complete bipartite graphs
- Rainbow generalizations of Ramsey theory: A survey
- The rainbow number of matchings in regular bipartite graphs
- The anti-Ramsey number of perfect matching
- On restricted colourings of \(K_ n\)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Bipartite rainbow numbers of matchings
- Complete solution for the rainbow numbers of matchings
- Matching theory
- Edge-colorings of complete graphs that avoid polychromatic trees
- Edge-colorings with no large polychromatic stars
- Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
- Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
- Anti-Ramsey numbers of subdivided graphs
- Rainbow numbers for matchings and complete graphs
- Anti-Ramsey numbers for graphs with independent cycles
- 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
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- Rainbow Numbers for Cycles in Plane Triangulations
- Anti-Ramsey numbers for matchings in regular bipartite graphs
- An anti-Ramsey theorem
- Rainbow cliques in edge-colored graphs
This page was built for publication: Rainbow matchings in edge-colored complete split graphs
