Chunqiu Fang

activity

20192026

most citedTurán numbers and anti-Ramsey numbers for short cycles in complete

3

-partite graphs

2 citations · 3 across the 5 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019

Minimal colorings for properly colored subgraphs in complete graphs

Chunqiu Fang, Ervin Győri, Jimeng Xiao

Let $p r (K_{n}, G)$ be the maximum number of colors in an edge-coloring of $K_{n}$ with no properly colored copy of $G$ . In this paper, we show that $pr(K_{n}, G)-ex(n, \mathcal{G'}…

math.CO2019

On the anti-Ramsey number of forests

Chunqiu Fang, Ervin Győri, Mei Lu +1

We call a subgraph of an edge-colored graph rainbow subgraph, if all of its edges have different colors. The anti-Ramsey number of a graph $G$ in a complete graph $K_{n}$ , denoted…