Anti-Ramsey coloring for matchings in complete bipartite graphs

Zemin Jin () and Yuping Zang
Additional contact information
Zemin Jin: Zhejiang Normal University
Yuping Zang: Zhejiang Normal University

Journal of Combinatorial Optimization, 2017, vol. 33, issue 1, No 1, 12 pages

Abstract: Abstract The anti-Ramsey number AR(G, H) is defined to be the maximum number of colors in an edge coloring of G which doesn’t contain any rainbow subgraphs isomorphic to H. It is clear that there is an $$AR(K_{m,n},kK_2)$$ A R ( K m , n , k K 2 ) -edge-coloring of $$K_{m,n}$$ K m , n that doesn’t contain any rainbow $$kK_2$$ k K 2 . In this paper, we show the uniqueness of this kind of $$AR(K_{m,n},kK_2)$$ A R ( K m , n , k K 2 ) -edge-coloring of $$K_{m,n}$$ K m , n .

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

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9926-2 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:33:y:2017:i:1:d:10.1007_s10878-015-9926-2

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

DOI: 10.1007/s10878-015-9926-2

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 ().