Yisai Xue

activity

20212026

most citedAnti-Ramsey number of matchings in

r

-partite

r

-uniform hypergraphs

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

collaborators

Showing 2025Show all

4 papers · 1 filter

math.CO2025

Edge density and minimum degree thresholds for $H$ -free graphs with unbounded chromatic number

Zhuo Wu, Yisai Xue

The chromatic threshold $δ_{χ} (H)$ of a graph $H$ is the infimum of $d > 0$ such that the chromatic number of every $n$ -vertex $H$ -free graph with minimum degree at least $d n$ is bound…

math.CO2025

A directed Andrásfai-Erdős-Sós theorem and chromatic profiles of oriented cycles

Yisai Xue

The chromatic profile of a digraph $H$ , denoted by $δ_{χ}^{+} (H, k)$ , is the infimum $d$ such that any $H$ -free digraph $D$ on $n$ vertices with minimum out-degree $δ^{+} (D) \geq d n$ m…

math.CO2025

Stability with minuscule structure for chromatic thresholds

Jaehoon Kim, Hong Liu, Chong Shangguan +3

The chromatic threshold $δ_{χ} (H)$ of a graph $H$ is the infimum of $d > 0$ such that the chromatic number of every $n$ -vertex $H$ -free graph with minimum degree at least $d n$ is boun…

math.CO2025

On generalized Tur{á}n problems with bounded matching number and circumference

Yongchun Lu, Liying Kang, Yisai Xue

Let $ \mathcal{F} $ be a family of graphs. The generalized Turán number $ \operatorname{ex}(n, K_r, \mathcal{F}) $ is the maximum number of $K_{r}$ in an $ n $-vertex graph tha…

Edge density and minimum degree thresholds for H-free graphs with unbounded chromatic number

A directed Andrásfai-Erdős-Sós theorem and chromatic profiles of oriented cycles

Stability with minuscule structure for chromatic thresholds

On generalized Tur{á}n problems with bounded matching number and circumference

Edge density and minimum degree thresholds for $H$ -free graphs with unbounded chromatic number