Anti-Ramsey coloring for matchings in complete bipartite graphs
type: Item
instance of: scholarly article
title: Anti-Ramsey coloring for matchings in complete bipartite graphs
zbMATH Open document ID: 1357.05044
author: Yuping Zang
author: Zemin Jin
published in: Journal of Combinatorial Optimization
publication date: 2017-03-03T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05D10
zbMATH DE Number: 6691080
zbMATH Keywords: anti-Ramsey number
zbMATH Keywords: matching
zbMATH Keywords: rainbow
MaRDI profile type: Publication
full work available at URL: s10878-015-9926-2
OpenAlex ID: W2186017559
cites work: On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
cites work: Q5463539
cites work: Bipartite anti-Ramsey numbers of cycles
cites work: Complete solution for the rainbow numbers of matchings
cites work: Q4075490
cites work: Rainbow generalizations of Ramsey theory: A survey
cites work: Edge-colorings with no large polychromatic stars
cites work: Anti-Ramsey numbers of subdivided graphs
cites work: On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
cites work: Edge-colorings of complete graphs that avoid polychromatic trees
cites work: Q2931471
cites work: Anti-Ramsey numbers for graphs with independent cycles
cites work: Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
cites work: Bipartite rainbow numbers of matchings
cites work: The rainbow number of matchings in regular bipartite graphs
cites work: Matching theory
cites work: An anti-Ramsey theorem
cites work: An anti-Ramsey theorem on cycles
cites work: Rainbow numbers for matchings and complete graphs
cites work: On restricted colourings of \(K_ n\)
DOI: 10.1007/S10878-015-9926-2
description: scientific article; zbMATH DE number 6691080