Qing-Qing Zhao

activity

20152026

most citedGallai-Ramsey numbers for graphs with five vertices of chromatic number four

2 citations · 6 across the 10 of their papers we have counts for

collaborators

10 papers

math.CO2026

Multicolor Ramsey and list Ramsey numbers for star-like trees

Qinghong Zhao, Yaping Mao, Xiangqian Zhou

For a graph $H$, the $k$-color Ramsey number $r(H;k)$ is the least integer $N$ such that every $k$-edge-coloring of $K_N$ contains a monochromatic copy of $H$. A \(k\…

math.NT2026

Gap spectra and densities of slow Fibonacci walks

Yaping Mao, Qinghong Zhao

Let $F_{1} = F_{2} = 1$ and $F_{t + 2} = F_{t + 1} + F_{t}$ for $t \geq 1$ . For every $n \geq 2$ , there are unique integers $a, b, t$ such that $n = a F_{t} + b F_{t - 1}$ with $t \geq 2$ and $1 \leq a \leq b \leq F_{t}$ .…

math.CO2026

Ramsey multiplicity for ordered graphs

Mengya He, Yaping Mao, Bing Wei +1

Let $\cG_1,\ldots,\cG_k$ be fixed vertex-ordered graphs, each containing at least one edge. The ordered Ramsey number $\oR(\cG_1,\ldots,\cG_k)$ is the least integer $N$ such…

math.CO2022

Some exact values on Ramsey numbers related to fans

Qinghong Zhao, Bing Wei

For two given graphs $F$ and $H$ , the Ramsey number $R (F, H)$ is the smallest integer $N$ such that any red-blue edge-coloring of the complete graph $K_{N}$ contains a red $F$ or a bl…

math.CO2022

Bonds intersecting long paths in $k$ -connected graphs

Bing Wei, Haidong Wu, Qinghong Zhao

A well-known question of Gallai (1966) asked whether there is a vertex which passes through all longest paths of a connected graph. Although this has been verified for some special…

math.CO2020★ 2 cited

Gallai-Ramsey numbers for graphs with five vertices of chromatic number four

Qinghong Zhao, Bing Wei

Given a graph $H$ and an integer $k \geq 1$ , the Gallai-Ramsey number $G R_{k} (H)$ is defined to be the minimum integer $n$ such that every $k$ -edge coloring of $K_{n}$ contains either a r…

math.CO2020★ 2 cited

Gallai-Ramsey numbers for graphs with chromatic number three

Qinghong Zhao, Bing Wei

Given a graph $H$ and an integer $k \geq 1$ , the Gallai-Ramsey number $G R_{k} (H)$ is defined to be the minimum integer $n$ such that every $k$ -edge coloring of the complete graph $K_{n}$ …

math.CO2019★ 1 cited

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…

math.NT2017

Powerful numbers in $(1^{ℓ} + q^{ℓ}) (2^{ℓ} + q^{ℓ}) \dots (n^{ℓ} + q^{ℓ})$

Quan-Hui Yang, Qing-Qing Zhao

Let $q$ be a positive integer. Recently, Niu and Liu proved that if $n \geq max {q, 1198 - q}$ , then the product $(1^{3} + q^{3}) (2^{3} + q^{3}) \dots (n^{3} + q^{3})$ is not a powerful number. In this…

math.NT2015★ 1 cited

On the sumsets of exceptional units in $Z_{n}$

Quan-Hui Yang, Qing-Qing Zhao

Let $R$ be a commutative ring with $1 \in R$ and $R^{*}$ be the multiplicative group of its units. In 1969, Nagell introduced the exceptional unit $u$ if both $u$ and $1 - u$ belon…

Multicolor Ramsey and list Ramsey numbers for star-like trees

Gap spectra and densities of slow Fibonacci walks

Ramsey multiplicity for ordered graphs

Some exact values on Ramsey numbers related to fans

Bonds intersecting long paths in k-connected graphs

Gallai-Ramsey numbers for graphs with five vertices of chromatic number four

Gallai-Ramsey numbers for graphs with chromatic number three

A note on Gallai-Ramsey number of even wheels

Powerful numbers in (1ℓ+qℓ)(2ℓ+qℓ)⋯(nℓ+qℓ)

On the sumsets of exceptional units in Zn​

Bonds intersecting long paths in $k$ -connected graphs

Powerful numbers in $(1^{ℓ} + q^{ℓ}) (2^{ℓ} + q^{ℓ}) \dots (n^{ℓ} + q^{ℓ})$

On the sumsets of exceptional units in $Z_{n}$