Xihe Li

activity

20182026

most citedForbidden rainbow subgraphs that force large monochromatic or multicolored k-connected subgraphs

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

collaborators

14 papers

cs.CC2026

NP-hardness of additive approximation for generalized Turán problems

Yihan Chen, Jialin He, Xihe Li +2

For a fixed graph $T$ and a fixed nonempty family $F$ of graphs, let $ex (G, T, F)$ denote the maximum number of copies of $T$ in an $F$ …

math.CO2026

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…

math.CO2026

On the rainbow Cameron-Erdős problem with respect to generalized Sidon sets of multidimensional grids

Xihe Li, Runshan Wang

For positive integers $n$ , $d$ , $k$ and $h$ , let $[n]^{d}$ be the $d$ -dimensional grid of order $n$ , and we refer to the equation $\sum_{i=1}^{h}x_{1,i}=\cdots =\sum_{i=1}^{h}x_{k,i}…

math.CO2025

Constrained Ramsey numbers for rainbow $P_{5}$

Xihe Li, Xiangxiang Liu

For any graph $H$ , let $R_{k} (H)$ denote the minimum integer $n$ such that in every $k$ -edge-coloring of $K_{n}$ , there is a monochromatic copy of $H$ . Given two graphs $H$ and $G$ ,…

math.CO2025

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…

math.CO2024★ 1 cited

On the multicolor Turán conjecture for color-critical graphs

Xihe Li, Jie Ma, Zhiheng Zheng

A {\it simple $k$ -coloring} of a multigraph $G$ is a decomposition of the edge multiset as a disjoint sum of $k$ simple graphs which are referred as colors. A subgraph $H$ of a mul…

math.CO2024

Weak rainbow saturation numbers of graphs

Xihe Li, Jie Ma, Tianying Xie

For a fixed graph $H$ , we say that an edge-colored graph $G$ is \emph{weakly $H$ -rainbow saturated} if there exists an ordering $e_{1}, e_{2}, \dots, e_{m}$ of $E\left(\overline{G}\righ…

math.CO2021

Growth rates of the bipartite Erdős-Gyárfás function

Xihe Li, Hajo Broersma, Ligong Wang

Given two graphs $G, H$ and a positive integer $q$ , an $(H, q)$ -coloring of $G$ is an edge-coloring of $G$ such that every copy of $H$ in $G$ receives at least $q$ distinct colors.…

math.CO2020★ 1 cited

The Erdős-Gyárfás function with respect to Gallai-colorings

Xihe Li, Hajo Broersma, Ligong Wang

For fixed $p$ and $q$ , an edge-coloring of the complete graph $K_{n}$ is said to be a $(p, q)$ -coloring if every $K_{p}$ receives at least $q$ distinct colors. The function $f(n, p, q)…

math.CO2020

Extremal problems and results related to Gallai-colorings

Xihe Li, Hajo Broersma, Ligong Wang

A Gallai-coloring (Gallai- $k$ -coloring) is an edge-coloring (with colors from ${1, 2, \dots, k}$ ) of a complete graph without rainbow triangles. Given a graph $H$ and a positive…

math.CO2019

Gallai-Ramsey numbers for rainbow paths

Xihe Li, Pierre Besse, Colton Magnant +2

Given graphs $G$ and $H$ and a positive integer $k$ , the \emph{Gallai-Ramsey number}, denoted by $g r_{k} (G : H)$ is defined to be the minimum integer $n$ such that every coloring o…

math.CO2018★ 1 cited

Gallai-Ramsey numbers for a class of graphs with five vertices

Xihe Li, Ligong Wang

Given two graphs $G$ and $H$ , the $k$ -colored Gallai-Ramsey number $g r_{k} (G : H)$ is defined to be the minimum integer $n$ such that every $k$ -coloring of the complete graph on $n$ …

math.CO2018★ 1 cited

Forbidden rainbow subgraphs that force large monochromatic or multicolored k-connected subgraphs

Xihe Li, Ligong Wang

Let $n, k, m$ be positive integers with $n ≫ m ≫ k$ , and let $A$ be the set of graphs $G$ of order at least 3 such that there is a $k$ -connected monochromatic subgraph…

math.CO2018

The unicyclic graphs with the second smallest normalized Laplacian eigenvalue no less than $1 - \frac{6}{3}$

Weige Xi, Ligong Wang, Xiangxiang Liu +2

Let $λ_{2} (G)$ be the second smallest normalized Laplacian eigenvalue of a graph $G$ . In this paper, we determine all unicyclic graphs of order $n \geq 21$ with $λ_{2}(G)\geq 1-\frac…

NP-hardness of additive approximation for generalized Turán problems

Ramsey-type results for threshold graphs and beyond

On the rainbow Cameron-Erdős problem with respect to generalized Sidon sets of multidimensional grids

Constrained Ramsey numbers for rainbow P5​

Edge-colored 3-uniform hypergraphs without rainbow paths of length 3 and applications to Ramsey theory

On the multicolor Turán conjecture for color-critical graphs

Weak rainbow saturation numbers of graphs

Growth rates of the bipartite Erdős-Gyárfás function

The Erdős-Gyárfás function with respect to Gallai-colorings

Extremal problems and results related to Gallai-colorings

Gallai-Ramsey numbers for rainbow paths

Gallai-Ramsey numbers for a class of graphs with five vertices

Forbidden rainbow subgraphs that force large monochromatic or multicolored k-connected subgraphs

The unicyclic graphs with the second smallest normalized Laplacian eigenvalue no less than 1−36​​

Constrained Ramsey numbers for rainbow $P_{5}$

The unicyclic graphs with the second smallest normalized Laplacian eigenvalue no less than $1 - \frac{6}{3}$