Meilian Liang

activity

20142024

most citedChromatic Vertex Folkman Numbers

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

collaborators

6 papers

math.CO2024

Some constructive results on Disjoint Golomb Rulers

Xiaodong Xu, Baoxin Xiu, Changjun Fan +1

A set ${a_{i} ∣ 1 \leq i \leq k}$ of non-negative integers is a Golomb ruler if differences $a_{i} - a_{j}$ , for any $i \neq = j$ , are all distinct.All finite Sidon sets are Golomb ruler…

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.CO2017

On the Nonexistence of Some Generalized Folkman Numbers

Xiaodong Xu, Meilian Liang, Stanisław Radziszowski

For an undirected simple graph $G$ , we write $G \to (H_{1}, H_{2})^{v}$ if and only if for every red-blue coloring of its vertices there exists a red $H_{1}$ or a blue $H_{2}$ . The g…

math.CO2016★ 3 cited

Chromatic Vertex Folkman Numbers

Xiaodong Xu, Meilian Liang, Stanisław Radziszowski

For graph $G$ and integers $a_{1} \geq \dots \geq a_{r} \geq 2$ , we write $G \to (a_{1}, \dots, a_{r})^{v}$ if and only if for every $r$ -coloring of the vertex set $V (G)$ there exists…

cs.IT2014

On Disjoint Golomb Rulers

Xiu Baoxin, Changjun Fan, Meilian Liang

A set ${a_{i} ∣ 1 \leq i \leq k}$ of non-negative integers is a Golomb ruler if differences $a_{i} - a_{j}$ , for any $i \neq = j$ , are all distinct. A set of $I$ disjoint Golomb rulers (…