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 6 of their papers we have counts for

collaborators

7 papers

math.CO2026

On the minimum number of triangles in balanced tripartite graphs with large minimum degree

Chunqiu Fang, Rongxing Xu

Let $f (n, t)$ be the minimum number of triangles in a tripartite graph with $n$ vertices in each part and minimum degree at least $n + t$ . In 1975, Bollobás, Erdős and Szemerédi prove…

math.CO2026

Codegree Thresholds for $λ$ -Choosability of Graphs

Chunqiu Fang, Rongxing Xu

Let $λ = {k_{1}, \dots, k_{q}}$ be a partition, and let $∣ λ ∣ = k_{1} + \dots + k_{q}$ . A $∣ λ ∣$ -list assignment $L$ of a graph $G$ is a $λ$ -assignment if its color set can be partitioned into $q$ …

math.CO2023

On local Turán density problems of hypergraphs

Chunqiu Fang, Guorong Gao, Jie Ma +1

For integers $q \geq p \geq r \geq 2$ , we say that an $r$ -uniform hypergraph $H$ has property $(q, p)$ , if for any $q$ -vertex subset $Q$ of $V (H)$ , there exists a $p$ -vertex subset $P$ of…

math.CO2020★ 2 cited

Turán numbers and anti-Ramsey numbers for short cycles in complete $3$ -partite graphs

Chunqiu Fang, Ervin Győri, Chuanqi Xiao +1

We call a $4$ -cycle in $K_{n_{1}, n_{2}, n_{3}}$ multipartite, denoted by $C_{4}^{multi}$ , if it contains at least one vertex in each part of $K_{n_{1}, n_{2}, n_{3}}$ . The…

math.CO2020★ 1 cited

The anti-Ramsey number of $C_{3}$ and $C_{4}$ in the complete $r$ -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 $G$ and a family $H$ of graphs, the anti-Ramsey number $ar(G, \math…

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…