Extremal coloring for the anti-Ramsey problem of matchings in complete graphs

DOI10.1007/s10878-017-0125-1zbMath1374.05090MaRDI QIDQ1679499

Peng Zhang

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

zbMATH Keywords

anti-Ramsey number; rainbow matching; extremal coloring

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C15: Coloring of graphs and hypergraphs

05C55: Generalized Ramsey theory

05D10: Ramsey theory