13 citations · 27 across the 13 of their papers we have counts for
17 papers
On a Diagonal Conjecture for Classical Ramsey Numbers
Meilian Liang, Stanisław Radziszowski, Xiaodong Xu
Let denote the classical -color Ramsey number for integers . The Diagonal Conjecture (DC) for classical Ramsey numbers poses that if $k_1, \cdot…
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…
On the Nonexistence of Some Generalized Folkman Numbers
Xiaodong Xu, Meilian Liang, Stanisław Radziszowski
For an undirected simple graph , we write if and only if for every red-blue coloring of its vertices there exists a red or a blue . The g…
Chromatic Vertex Folkman Numbers
Xiaodong Xu, Meilian Liang, Stanisław Radziszowski
For graph and integers , we write if and only if for every -coloring of the vertex set there exists…
Zarankiewicz Numbers and Bipartite Ramsey Numbers
Alex Collins, Alexander Riasanovsky, John Wallace +1
The Zarankiewicz number is the maximum size of a subgraph of which does not contain as a subgraph. The two-color bipartite Ramsey number is th…
A step forwards on the Erdős-Sós problem concerning the Ramsey numbers
Rujie Zhu, Xiaodong Xu, Stanisław Radziszowski
Let , where is the Ramsey number of graphs and defined as the smallest such that any edge coloring of with two colors cont…