Xiaodong Xu

activity

20152022

most citedOn almost perfect linear Lee codes of packing radius 2

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

collaborators

4 papers

math.CO2022★ 1 cited

On almost perfect linear Lee codes of packing radius 2

Xiaodong Xu, Yue Zhou

More than 50 years ago, Golomb and Welch conjectured that there is no perfect Lee codes $C$ of packing radius $r$ in $Z^{n}$ for $r \geq 2$ and $n \geq 3$ . Recently, Leung an…

math.CO2018

On a Diagonal Conjecture for Classical Ramsey Numbers

Meilian Liang, Stanisław Radziszowski, Xiaodong Xu

Let $R (k_{1}, \dots, k_{r})$ denote the classical $r$ -color Ramsey number for integers $k_{i} \geq 2$ . The Diagonal Conjecture (DC) for classical Ramsey numbers poses that if $k_1, \cdot…

math.CO2017

A Note on Upper Bounds for Some Generalized Folkman Numbers

Xiaodong Xu, Meilian Liang, Stanisław Radziszowski

We present some new constructive upper bounds based on product graphs for generalized vertex Folkman numbers. They lead to new upper bounds for some special cases of generalized ed…

math.CO2015

A step forwards on the Erdős-Sós problem concerning the Ramsey numbers $R (3, k)$

Rujie Zhu, Xiaodong Xu, Stanisław Radziszowski

Let $Δ_{s} = R (K_{3}, K_{s}) - R (K_{3}, K_{s - 1})$ , where $R (G, H)$ is the Ramsey number of graphs $G$ and $H$ defined as the smallest $n$ such that any edge coloring of $K_{n}$ with two colors cont…

On almost perfect linear Lee codes of packing radius 2

On a Diagonal Conjecture for Classical Ramsey Numbers

A Note on Upper Bounds for Some Generalized Folkman Numbers

A step forwards on the Erdős-Sós problem concerning the Ramsey numbers R(3,k)

A step forwards on the Erdős-Sós problem concerning the Ramsey numbers $R (3, k)$