Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
From MaRDI portal
Publication:1679499
DOI10.1007/S10878-017-0125-1zbMath1374.05090OpenAlexW2595801007MaRDI QIDQ1679499
Publication date: 9 November 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-017-0125-1
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (7)
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 number of matchings in a hypergraph ⋮ Rainbow numbers for paths in planar graphs ⋮ Rainbow matchings in edge-colored complete split graphs ⋮ Rainbow triangles in edge-colored Kneser graphs
Cites Work
- Anti-Ramsey numbers in complete split graphs
- 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
- 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
- Anti-Ramsey numbers for matchings in regular bipartite graphs
- An anti-Ramsey theorem
- Rainbow cliques in edge-colored graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
