2 citations · 3 across the 4 of their papers we have counts for
5 papers
Codegree Thresholds for -Choosability of Graphs
Chunqiu Fang, Rongxing Xu
Let be a partition, and let . A -list assignment of a graph is a -assignment if its color set can be partitioned into …
Turán numbers and anti-Ramsey numbers for short cycles in complete -partite graphs
Chunqiu Fang, Ervin Győri, Chuanqi Xiao +1
We call a -cycle in multipartite, denoted by , if it contains at least one vertex in each part of . The…
The anti-Ramsey number of and in the complete -partite graphs
Chunqiu Fang, Ervin Győri, Binlong Li +1
A subgraph of an edge-colored graph is rainbow, if all of its edges have different colors. For a graph and a family of graphs, the anti-Ramsey number $ar(G, \math…
Minimal colorings for properly colored subgraphs in complete graphs
Chunqiu Fang, Ervin Győri, Jimeng Xiao
Let be the maximum number of colors in an edge-coloring of with no properly colored copy of . In this paper, we show that $pr(K_{n}, G)-ex(n, \mathcal{G'}…
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 in a complete graph , denoted…