2019/11/11 by Chunqiu Fang, Fang, Chunqiu, Ervin Győri +3
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory #math.CO
paper · pdf · doi:10.48550/arxiv.1911.04358
17 pages
arxiv created 2019/11/11 · openalex publication_date 2019/11/11 · arxiv updated 2019/11/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let pr(Kn, G) be the maximum number of colors in an edge-coloring of Kn with no properly colored copy of G. In this paper, we show that pr(Kn, G)-ex(n, G')=o(n2), where G'=\G-M: M is a matching of G\. Furthermore, we determine the value of pr(Kn, Pl) for l≥ 27 and n≥ 2l3 and the exact value of pr(Kn, G), where G is C5, C6 and K4-, respectively. Also, we give an upper bound and a lower bound of pr(Kn, K2,3).