Fangfang Zhang

activity

20182025

most citedAntimagic orientations of graphs with given independence number

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

collaborators

7 papers

math.CO2025

Turán problems for suspension of a balanced tree

Xiutao Zhu, Xiaolin Wang, Yanbo Zhang +1

The Turán number $\ex(n,H)$ is the maximum number of edges that an $n$ -vertex $H$ -free graph can have. The suspension $H$ is obtained from $H$ by adding a new vertex whic…

math.CO2023

Maximum cliques in a graph without disjoint given subgraph

Fangfang Zhang, Yaojun Chen, Ervin Gyori +1

The generalized Turán number $\ex(n,K_s,F)$ denotes the maximum number of copies of $K_{s}$ in an $n$ -vertex $F$ -free graph. Let $k F$ denote $k$ disjoint copies of $F$ . Gerbner, Meth…

math.CO2019★ 1 cited

Antimagic orientations of graphs with given independence number

Zi-Xia Song, Donglei Yang, Fangfang Zhang

Given a digraph $D$ with $m$ arcs and a bijection $τ : A (D) \to {1, 2, \dots, m}$ , we say $(D, τ)$ is an antimagic orientation of a graph $G$ if $D$ is an orientation of $…

math.CO2019

Antimagic orientations of graphs with large maximum degree

Donglei Yang, Joshua Carlson, Andrew Owens +5

Given a digraph $D$ with $m$ arcs, a bijection $τ : A (D) \to {1, 2, \dots, m}$ is an antimagic labeling of $D$ if no two vertices in $D$ have the same vertex-sum, where t…

math.CO2019

Gallai-Ramsey number of even cycles with chords

Fangfang Zhang, Zi-Xia Song, Yaojun Chen

For a graph $H$ and an integer $k \geq 1$ , the $k$ -color Ramsey number $R_{k} (H)$ is the least integer $N$ such that every $k$ -coloring of the edges of the complete graph $K_{N}$ contains…

math.CO2019

A note on Gallai-Ramsey number of even wheels

Zi-Xia Song, Bing Wei, Fangfang Zhang +1

A Gallai coloring of a complete graph is an edge-coloring such that no triangle has all its edges colored differently. A Gallai $k$ -coloring is a Gallai coloring that uses $k$ colo…