10 papers · 1 filter
Ramsey-type results for threshold graphs and beyond
Xihe Li
A {\it threshold graph} is a graph that can be constructed from the one-vertex graph by repeatedly adding either a dominating vertex or an isolated vertex. Motivated by an induced…
On the rainbow Cameron-Erdős problem with respect to generalized Sidon sets of multidimensional grids
Xihe Li, Runshan Wang
For positive integers , , and , let be the -dimensional grid of order , and we refer to the equation $\sum_{i=1}^{h}x_{1,i}=\cdots =\sum_{i=1}^{h}x_{k,i}…
Constrained Ramsey numbers for rainbow
Xihe Li, Xiangxiang Liu
Given a graph and a positive integer , the {\it -colored Ramsey number} is the minimum integer such that in every -edge-coloring of the complete graph $K_…
Edge-colored 3-uniform hypergraphs without rainbow paths of length 3 and applications to Ramsey theory
Xihe Li, Runshan Wang
Motivated by problems in Ramsey theory, we study edge-colorings of 3-uniform hypergraphs that contain no rainbow paths of length 3. We consider the following three natural 3-unifor…
On the multicolor Turán conjecture for color-critical graphs
Xihe Li, Jie Ma, Zhiheng Zheng
A {\it simple -coloring} of a multigraph is a decomposition of the edge multiset as a disjoint sum of simple graphs which are referred as colors. A subgraph of a mul…
Weak rainbow saturation numbers of graphs
Xihe Li, Jie Ma, Tianying Xie
For a fixed graph , we say that an edge-colored graph is \emph{weakly -rainbow saturated} if there exists an ordering of $E\left(\overline{G}\righ…