2 citations · 6 across the 10 of their papers we have counts for
7 papers · 1 filter
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\…
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…
Some exact values on Ramsey numbers related to fans
Qinghong Zhao, Bing Wei
For two given graphs and , the Ramsey number is the smallest integer such that any red-blue edge-coloring of the complete graph contains a red or a bl…
Bonds intersecting long paths in -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…
Gallai-Ramsey numbers for graphs with five vertices of chromatic number four
Qinghong Zhao, Bing Wei
Given a graph and an integer , the Gallai-Ramsey number is defined to be the minimum integer such that every -edge coloring of contains either a r…
Gallai-Ramsey numbers for graphs with chromatic number three
Qinghong Zhao, Bing Wei
Given a graph and an integer , the Gallai-Ramsey number is defined to be the minimum integer such that every -edge coloring of the complete graph …
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 -coloring is a Gallai coloring that uses colo…