Anti-Ramsey numbers in complete split graphs
From MaRDI portal
Publication:279216
DOI10.1016/j.disc.2015.10.038zbMath1334.05084OpenAlexW2186427744MaRDI QIDQ279216
Publication date: 27 April 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.10.038
Related Items
Anti-Ramsey number of Hanoi graphs ⋮ Extremal coloring for the anti-Ramsey problem of matchings in complete graphs ⋮ Anti-Ramsey numbers for matchings in regular bipartite graphs ⋮ Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All 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 matchings in edge-colored complete split graphs ⋮ Anti-Ramsey problems for cycles ⋮ Avoiding rainbow 2-connected subgraphs ⋮ Rainbow triangles in edge-colored Kneser graphs ⋮ Anti-Ramsey number of triangles in complete multipartite graphs ⋮ Anti-Ramsey numbers for cycles in \(n\)-prisms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rainbow numbers for matchings in plane triangulations
- Rainbow generalizations of Ramsey theory: A survey
- The anti-Ramsey number of perfect matching
- Rainbows in the hypercube
- Rainbow numbers for graphs containing small cycles
- Rainbow numbers for cycles with pendant edges
- Bipartite rainbow numbers of matchings
- A rainbow \(k\)-matching in the complete graph with \(r\) colors
- 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
- Rainbow numbers for small stars with one edge added
- 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
