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

Zemin Jin (), Yuefang Sun (), Sherry H. F. Yan () and Yuping Zang
Additional contact information
Zemin Jin: Zhejiang Normal University
Yuefang Sun: Shaoxing University
Sherry H. F. Yan: Zhejiang Normal University
Yuping Zang: Zhejiang Normal University

Journal of Combinatorial Optimization, 2017, vol. 34, issue 4, No 2, 1012-1028

Abstract: Abstract Given a graph G, the anti-Ramsey number $$AR(K_n,G)$$ A R ( K n , G ) is defined to be the maximum number of colors in an edge-coloring of $$K_n$$ K n which does not contain any rainbow G (i.e., all the edges of G have distinct colors). The anti-Ramsey number was introduced by Erdős et al. (Infinite and finite sets, pp 657–665, 1973) and so far it has been determined for several special graph classes. Another related interesting problem posed by Erdős et al. is the uniqueness of the extremal coloring for the anti-Ramsey number. Contrary to the anti-Ramsey number, there are few results about the extremal coloring. In this paper, we show the uniqueness of such extremal coloring for the anti-Ramsey number of matchings in the complete graph.

Keywords: Anti-Ramsey number; Rainbow matching; Extremal coloring; 05C15; 05C35; 05C55; 05C70; 05D10 (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-017-0125-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:34:y:2017:i:4:d:10.1007_s10878-017-0125-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-017-0125-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().